java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:38:12,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:38:12,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:38:12,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:38:12,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:38:12,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:38:12,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:38:12,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:38:12,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:38:12,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:38:12,926 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:38:12,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:38:12,927 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:38:12,928 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:38:12,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:38:12,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:38:12,932 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:38:12,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:38:12,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:38:12,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:38:12,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:38:12,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:38:12,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:38:12,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:38:12,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:38:12,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:38:12,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:38:12,941 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:38:12,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:38:12,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:38:12,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:38:12,942 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:38:12,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:38:12,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:38:12,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:38:12,954 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:38:12,954 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:38:12,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:38:12,954 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:38:12,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:38:12,954 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:38:12,954 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:38:12,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:38:12,955 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:38:12,955 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:38:12,955 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:38:12,955 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:38:12,955 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:38:12,955 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:38:12,956 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:38:12,956 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:38:12,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:38:12,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:38:12,956 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:38:12,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:38:12,957 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:38:12,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:38:12,993 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:38:12,996 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:38:12,997 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:38:12,997 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:38:12,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:38:13,119 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:38:13,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:38:13,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:38:13,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:38:13,124 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:38:13,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:38:13" (1/1) ... [2018-02-04 17:38:13,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a17581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13, skipping insertion in model container [2018-02-04 17:38:13,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:38:13" (1/1) ... [2018-02-04 17:38:13,136 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:38:13,164 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:38:13,255 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:38:13,271 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:38:13,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13 WrapperNode [2018-02-04 17:38:13,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:38:13,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:38:13,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:38:13,278 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:38:13,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13" (1/1) ... [2018-02-04 17:38:13,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13" (1/1) ... [2018-02-04 17:38:13,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13" (1/1) ... [2018-02-04 17:38:13,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13" (1/1) ... [2018-02-04 17:38:13,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13" (1/1) ... [2018-02-04 17:38:13,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13" (1/1) ... [2018-02-04 17:38:13,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13" (1/1) ... [2018-02-04 17:38:13,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:38:13,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:38:13,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:38:13,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:38:13,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 17:38:13,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:38:13,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:38:13,353 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-02-04 17:38:13,353 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:38:13,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:38:13,518 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:38:13,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:38:13 BoogieIcfgContainer [2018-02-04 17:38:13,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:38:13,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:38:13,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:38:13,522 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:38:13,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:38:13" (1/3) ... [2018-02-04 17:38:13,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b5b9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:38:13, skipping insertion in model container [2018-02-04 17:38:13,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:38:13" (2/3) ... [2018-02-04 17:38:13,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b5b9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:38:13, skipping insertion in model container [2018-02-04 17:38:13,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:38:13" (3/3) ... [2018-02-04 17:38:13,524 INFO L107 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:38:13,530 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:38:13,535 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 17:38:13,568 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:38:13,568 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:38:13,568 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:38:13,568 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:38:13,568 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:38:13,568 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:38:13,569 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:38:13,569 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:38:13,570 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:38:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-04 17:38:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:38:13,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:13,594 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:13,594 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442526, now seen corresponding path program 1 times [2018-02-04 17:38:13,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:13,600 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:13,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:13,644 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:13,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:13,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:13,716 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:13,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:13,717 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:13,718 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:13,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:13,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:13,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:13,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:13,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:38:13,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:13,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:13,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 17:38:13,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:13,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:13,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:38:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:13,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:13,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:38:13,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:38:13,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:38:13,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:38:13,942 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-02-04 17:38:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:14,037 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 17:38:14,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:38:14,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 17:38:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:14,043 INFO L225 Difference]: With dead ends: 54 [2018-02-04 17:38:14,044 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 17:38:14,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:38:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 17:38:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 17:38:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 17:38:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 17:38:14,067 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-02-04 17:38:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:14,067 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 17:38:14,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:38:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 17:38:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:38:14,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:14,068 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:14,068 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442527, now seen corresponding path program 1 times [2018-02-04 17:38:14,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:14,068 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:14,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,069 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:14,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:14,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:14,089 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:14,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:14,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:14,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:14,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:14,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:14,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:14,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:38:14,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:14,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:38:14,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:14,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:14,198 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:14,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-02-04 17:38:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:14,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:14,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:38:14,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:38:14,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:38:14,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:38:14,228 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-02-04 17:38:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:14,319 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-04 17:38:14,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:38:14,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 17:38:14,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:14,321 INFO L225 Difference]: With dead ends: 68 [2018-02-04 17:38:14,321 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 17:38:14,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:38:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 17:38:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-02-04 17:38:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 17:38:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-02-04 17:38:14,330 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 13 [2018-02-04 17:38:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:14,330 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-02-04 17:38:14,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:38:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-02-04 17:38:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:38:14,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:14,331 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:14,331 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1451517407, now seen corresponding path program 1 times [2018-02-04 17:38:14,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:14,332 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:14,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,332 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:14,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:14,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:14,350 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:14,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:14,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:14,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:14,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:14,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:14,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:14,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:38:14,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:14,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:14,422 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:14,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:38:14,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:14,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-02-04 17:38:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:14,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:14,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:38:14,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:38:14,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:38:14,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:38:14,448 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2018-02-04 17:38:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:14,494 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-02-04 17:38:14,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:38:14,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 17:38:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:14,495 INFO L225 Difference]: With dead ends: 56 [2018-02-04 17:38:14,495 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 17:38:14,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:38:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 17:38:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-02-04 17:38:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:38:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 17:38:14,499 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-02-04 17:38:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:14,500 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 17:38:14,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:38:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 17:38:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:38:14,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:14,500 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:14,500 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:14,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020018, now seen corresponding path program 1 times [2018-02-04 17:38:14,501 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:14,501 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:14,502 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,502 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:14,502 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:14,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:14,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:14,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:38:14,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:38:14,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:38:14,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:38:14,536 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-02-04 17:38:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:14,580 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 17:38:14,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:38:14,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:38:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:14,582 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:38:14,583 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:38:14,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:38:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:38:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 17:38:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 17:38:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 17:38:14,585 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-02-04 17:38:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:14,585 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 17:38:14,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:38:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 17:38:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:38:14,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:14,586 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:14,586 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020017, now seen corresponding path program 1 times [2018-02-04 17:38:14,586 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:14,586 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:14,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,588 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:14,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:14,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:14,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:14,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:38:14,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:38:14,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:38:14,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:38:14,640 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-02-04 17:38:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:14,663 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 17:38:14,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:38:14,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:38:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:14,663 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:38:14,663 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:38:14,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:38:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:38:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 17:38:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:38:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 17:38:14,666 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-02-04 17:38:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:14,666 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 17:38:14,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:38:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 17:38:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:38:14,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:14,666 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:14,666 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash -9248999, now seen corresponding path program 1 times [2018-02-04 17:38:14,667 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:14,667 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:14,667 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,667 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:14,667 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:14,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:14,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:14,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:38:14,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:38:14,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:38:14,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:38:14,705 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-02-04 17:38:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:14,753 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-04 17:38:14,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:38:14,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 17:38:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:14,754 INFO L225 Difference]: With dead ends: 46 [2018-02-04 17:38:14,754 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 17:38:14,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:38:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 17:38:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 17:38:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:38:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-02-04 17:38:14,756 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-02-04 17:38:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:14,756 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-02-04 17:38:14,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:38:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-02-04 17:38:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:38:14,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:14,757 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:14,757 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:14,757 INFO L82 PathProgramCache]: Analyzing trace with hash -9248998, now seen corresponding path program 1 times [2018-02-04 17:38:14,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:14,757 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:14,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:14,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:14,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:14,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:14,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:38:14,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:38:14,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:38:14,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:38:14,834 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-02-04 17:38:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:14,922 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-02-04 17:38:14,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:38:14,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 17:38:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:14,924 INFO L225 Difference]: With dead ends: 67 [2018-02-04 17:38:14,924 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 17:38:14,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:38:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 17:38:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-02-04 17:38:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 17:38:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-02-04 17:38:14,927 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-02-04 17:38:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:14,927 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-02-04 17:38:14,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:38:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-02-04 17:38:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:38:14,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:14,928 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:14,928 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:14,928 INFO L82 PathProgramCache]: Analyzing trace with hash -659041035, now seen corresponding path program 1 times [2018-02-04 17:38:14,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:14,928 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:14,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,928 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:14,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:14,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:14,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:14,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:38:14,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:38:14,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:38:14,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:38:14,984 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-02-04 17:38:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:15,033 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-02-04 17:38:15,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:38:15,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 17:38:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:15,034 INFO L225 Difference]: With dead ends: 54 [2018-02-04 17:38:15,034 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 17:38:15,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:38:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 17:38:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 17:38:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 17:38:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 17:38:15,036 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-02-04 17:38:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:15,036 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 17:38:15,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:38:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 17:38:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:38:15,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:15,037 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:15,037 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash -659041034, now seen corresponding path program 1 times [2018-02-04 17:38:15,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:15,038 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:15,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:15,038 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:15,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:15,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:15,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:15,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:38:15,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:38:15,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:38:15,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:38:15,103 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-02-04 17:38:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:15,177 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-02-04 17:38:15,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:38:15,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 17:38:15,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:15,178 INFO L225 Difference]: With dead ends: 70 [2018-02-04 17:38:15,178 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 17:38:15,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:38:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 17:38:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-02-04 17:38:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 17:38:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-02-04 17:38:15,183 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-02-04 17:38:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:15,183 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-02-04 17:38:15,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:38:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-02-04 17:38:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:38:15,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:15,184 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:15,184 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash 753859844, now seen corresponding path program 1 times [2018-02-04 17:38:15,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:15,184 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:15,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:15,185 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:15,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:15,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:15,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:15,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:38:15,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:38:15,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:38:15,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:38:15,201 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-02-04 17:38:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:15,213 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-02-04 17:38:15,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:38:15,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 17:38:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:15,214 INFO L225 Difference]: With dead ends: 67 [2018-02-04 17:38:15,214 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 17:38:15,214 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:38:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 17:38:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-02-04 17:38:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 17:38:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-02-04 17:38:15,219 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-02-04 17:38:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:15,219 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-02-04 17:38:15,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:38:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-02-04 17:38:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:38:15,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:15,220 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:15,220 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash 199156551, now seen corresponding path program 1 times [2018-02-04 17:38:15,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:15,221 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:15,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:15,221 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:15,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:15,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:15,236 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:15,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:15,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:15,237 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:15,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:15,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:15,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:38:15,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:15,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:15,323 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:15,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 17:38:15,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 17:38:15,348 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 11 treesize of output 10 [2018-02-04 17:38:15,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:15,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 17:38:15,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 17:38:15,375 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 11 treesize of output 10 [2018-02-04 17:38:15,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:15,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-02-04 17:38:15,782 WARN L143 SmtUtils]: Spent 262ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-04 17:38:15,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-02-04 17:38:15,860 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:38:15,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-02-04 17:38:15,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,868 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-02-04 17:38:15,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:15,882 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:64, output treesize:8 [2018-02-04 17:38:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:15,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:15,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 17:38:15,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:38:15,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:38:15,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:38:15,899 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 17 states. [2018-02-04 17:38:16,982 WARN L146 SmtUtils]: Spent 807ms on a formula simplification. DAG size of input: 57 DAG size of output 57 [2018-02-04 17:38:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:17,255 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-02-04 17:38:17,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:38:17,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-02-04 17:38:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:17,256 INFO L225 Difference]: With dead ends: 112 [2018-02-04 17:38:17,257 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 17:38:17,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:38:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 17:38:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-02-04 17:38:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 17:38:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-02-04 17:38:17,267 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 29 [2018-02-04 17:38:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:17,267 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-02-04 17:38:17,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:38:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-02-04 17:38:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:38:17,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:17,268 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:17,269 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:17,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1606281783, now seen corresponding path program 1 times [2018-02-04 17:38:17,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:17,269 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:17,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:17,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:17,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:17,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:17,287 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:17,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:17,288 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:17,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:17,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:17,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:17,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:17,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:17,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:38:17,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:17,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:17,346 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:17,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:17,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:17,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 17:38:17,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 17:38:17,372 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 11 treesize of output 10 [2018-02-04 17:38:17,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:17,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:17,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:17,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 17:38:17,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 17:38:17,406 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 11 treesize of output 10 [2018-02-04 17:38:17,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:17,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:17,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:17,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2018-02-04 17:38:17,915 WARN L143 SmtUtils]: Spent 334ms on a formula simplification that was a NOOP. DAG size: 41 [2018-02-04 17:38:17,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-02-04 17:38:17,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 17:38:17,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:17,991 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-02-04 17:38:17,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:17,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:18,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:18,012 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:68, output treesize:66 [2018-02-04 17:38:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:18,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:18,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:38:18,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:38:18,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:38:18,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:38:18,064 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 17 states. [2018-02-04 17:38:19,269 WARN L146 SmtUtils]: Spent 1009ms on a formula simplification. DAG size of input: 61 DAG size of output 61 [2018-02-04 17:38:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:19,681 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2018-02-04 17:38:19,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:38:19,681 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-02-04 17:38:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:19,681 INFO L225 Difference]: With dead ends: 129 [2018-02-04 17:38:19,682 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 17:38:19,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:38:19,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 17:38:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2018-02-04 17:38:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 17:38:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 139 transitions. [2018-02-04 17:38:19,685 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 139 transitions. Word has length 29 [2018-02-04 17:38:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:19,685 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 139 transitions. [2018-02-04 17:38:19,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:38:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2018-02-04 17:38:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:38:19,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:19,686 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:19,686 INFO L371 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:19,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594616, now seen corresponding path program 1 times [2018-02-04 17:38:19,686 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:19,686 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:19,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:19,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:19,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:19,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:19,697 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:19,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:19,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:19,698 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:19,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:19,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:19,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 27 [2018-02-04 17:38:19,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-02-04 17:38:19,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:19,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:19,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:19,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:38:19,784 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-02-04 17:38:19,788 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-02-04 17:38:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:19,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:19,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:38:19,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:38:19,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:38:19,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-02-04 17:38:19,794 INFO L87 Difference]: Start difference. First operand 113 states and 139 transitions. Second operand 8 states. [2018-02-04 17:38:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:19,867 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2018-02-04 17:38:19,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:38:19,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 17:38:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:19,868 INFO L225 Difference]: With dead ends: 112 [2018-02-04 17:38:19,868 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 17:38:19,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-02-04 17:38:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 17:38:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-04 17:38:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 17:38:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2018-02-04 17:38:19,871 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2018-02-04 17:38:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:19,872 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2018-02-04 17:38:19,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:38:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2018-02-04 17:38:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:38:19,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:19,873 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:19,873 INFO L371 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -797033429, now seen corresponding path program 1 times [2018-02-04 17:38:19,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:19,873 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:19,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:19,874 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:19,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:19,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:19,886 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:19,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:19,886 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:19,887 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:19,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:19,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:19,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:19,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:19,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:38:19,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:19,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:19,942 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:19,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:19,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:19,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 17:38:19,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 17:38:19,989 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 11 treesize of output 10 [2018-02-04 17:38:19,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:19,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:19,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:19,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 17:38:20,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 17:38:20,015 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 11 treesize of output 10 [2018-02-04 17:38:20,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:20,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-02-04 17:38:20,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:38:20,078 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:38:20,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-02-04 17:38:20,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-04 17:38:20,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-02-04 17:38:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 17:38:20,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:38:20,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 17:38:20,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:38:20,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:38:20,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:38:20,110 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 13 states. [2018-02-04 17:38:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:20,306 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-02-04 17:38:20,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:38:20,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-04 17:38:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:20,307 INFO L225 Difference]: With dead ends: 78 [2018-02-04 17:38:20,307 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 17:38:20,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:38:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 17:38:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 17:38:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 17:38:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-02-04 17:38:20,308 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 32 [2018-02-04 17:38:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:20,308 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-02-04 17:38:20,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:38:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-02-04 17:38:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:38:20,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:20,309 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:20,309 INFO L371 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:20,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1784966119, now seen corresponding path program 1 times [2018-02-04 17:38:20,309 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:20,309 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:20,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:20,310 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:20,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:20,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:20,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:20,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:20,453 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:20,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:20,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 6 treesize of output 5 [2018-02-04 17:38:20,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:38:20,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:38:20,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 13 treesize of output 12 [2018-02-04 17:38:20,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:20,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:38:20,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 17:38:20,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:38:20,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:20,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:20,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:20,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:38:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:20,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:20,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-02-04 17:38:20,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:38:20,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:38:20,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:38:20,733 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 20 states. [2018-02-04 17:38:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:21,091 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-02-04 17:38:21,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:38:21,091 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2018-02-04 17:38:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:21,092 INFO L225 Difference]: With dead ends: 93 [2018-02-04 17:38:21,092 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 17:38:21,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:38:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 17:38:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-02-04 17:38:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 17:38:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2018-02-04 17:38:21,095 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 32 [2018-02-04 17:38:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:21,095 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2018-02-04 17:38:21,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:38:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2018-02-04 17:38:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 17:38:21,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:21,097 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:21,097 INFO L371 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -553518792, now seen corresponding path program 2 times [2018-02-04 17:38:21,097 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:21,097 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:21,098 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:21,098 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:21,098 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:21,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:21,111 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:21,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:21,112 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:21,112 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:38:21,133 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:38:21,133 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:21,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:21,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:21,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:21,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:38:21,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:21,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:21,168 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:21,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:38:21,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:38:21,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:38:21,210 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 13 treesize of output 12 [2018-02-04 17:38:21,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 17:38:21,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 17:38:21,232 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 13 treesize of output 12 [2018-02-04 17:38:21,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:21,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:21,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-02-04 17:38:23,404 WARN L143 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 36 [2018-02-04 17:38:23,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-02-04 17:38:23,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-02-04 17:38:23,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:23,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 17:38:23,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:23,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-02-04 17:38:23,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-04 17:38:23,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2018-02-04 17:38:23,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:23,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-02-04 17:38:23,675 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:23,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-02-04 17:38:23,680 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:23,733 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-02-04 17:38:23,733 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:23,734 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-02-04 17:38:23,734 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:23,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-02-04 17:38:23,785 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-02-04 17:38:23,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-02-04 17:38:23,858 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:23,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-02-04 17:38:23,859 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:23,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-02-04 17:38:23,860 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:23,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 17:38:23,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:38:23,930 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-02-04 17:38:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:24,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:24,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:38:24,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:38:24,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:38:24,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:38:24,003 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand 17 states. [2018-02-04 17:38:25,604 WARN L146 SmtUtils]: Spent 1232ms on a formula simplification. DAG size of input: 52 DAG size of output 48 [2018-02-04 17:38:26,558 WARN L146 SmtUtils]: Spent 932ms on a formula simplification. DAG size of input: 45 DAG size of output 41 [2018-02-04 17:38:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:26,822 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2018-02-04 17:38:26,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:38:26,827 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-04 17:38:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:26,827 INFO L225 Difference]: With dead ends: 113 [2018-02-04 17:38:26,828 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 17:38:26,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:38:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 17:38:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2018-02-04 17:38:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 17:38:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2018-02-04 17:38:26,830 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 40 [2018-02-04 17:38:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:26,830 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2018-02-04 17:38:26,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:38:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-02-04 17:38:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 17:38:26,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:26,831 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:26,836 INFO L371 AbstractCegarLoop]: === Iteration 17 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:26,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1498931688, now seen corresponding path program 2 times [2018-02-04 17:38:26,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:26,836 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:26,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:26,837 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:26,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:26,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:27,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:27,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:27,168 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:38:27,193 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:38:27,194 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:27,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:27,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:27,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:27,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:27,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:38:27,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:38:27,257 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 13 treesize of output 12 [2018-02-04 17:38:27,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:27,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:27,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:27,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-02-04 17:38:27,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2018-02-04 17:38:27,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:27,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:27,797 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:38:27,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2018-02-04 17:38:27,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:27,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:27,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-02-04 17:38:27,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:27,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-02-04 17:38:27,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:27,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:27,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:27,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:196 [2018-02-04 17:38:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:28,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:28,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 35 [2018-02-04 17:38:28,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 17:38:28,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 17:38:28,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 17:38:28,029 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 36 states. [2018-02-04 17:38:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:29,927 INFO L93 Difference]: Finished difference Result 142 states and 170 transitions. [2018-02-04 17:38:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:38:29,927 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-02-04 17:38:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:29,928 INFO L225 Difference]: With dead ends: 142 [2018-02-04 17:38:29,928 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 17:38:29,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=576, Invalid=3980, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 17:38:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 17:38:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2018-02-04 17:38:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 17:38:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2018-02-04 17:38:29,932 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 43 [2018-02-04 17:38:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:29,932 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2018-02-04 17:38:29,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 17:38:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2018-02-04 17:38:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 17:38:29,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:29,933 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:29,933 INFO L371 AbstractCegarLoop]: === Iteration 18 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:29,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1718069032, now seen corresponding path program 1 times [2018-02-04 17:38:29,933 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:29,933 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:29,934 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:29,934 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:29,934 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:29,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:30,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:30,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:30,149 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:30,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:30,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:30,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:38:30,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:38:30,277 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 13 treesize of output 12 [2018-02-04 17:38:30,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:38:30,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 17:38:30,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:38:30,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:30,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:30,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:30,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:40 [2018-02-04 17:38:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:30,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:30,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-02-04 17:38:30,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:38:30,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:38:30,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:38:30,445 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand 20 states. [2018-02-04 17:38:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:30,802 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2018-02-04 17:38:30,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:38:30,802 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-02-04 17:38:30,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:30,803 INFO L225 Difference]: With dead ends: 138 [2018-02-04 17:38:30,803 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 17:38:30,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:38:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 17:38:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2018-02-04 17:38:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 17:38:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-02-04 17:38:30,805 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 43 [2018-02-04 17:38:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:30,805 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-02-04 17:38:30,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:38:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-02-04 17:38:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 17:38:30,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:30,806 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:30,806 INFO L371 AbstractCegarLoop]: === Iteration 19 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:30,806 INFO L82 PathProgramCache]: Analyzing trace with hash 512551529, now seen corresponding path program 3 times [2018-02-04 17:38:30,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:30,806 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:30,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:30,807 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:30,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:30,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:30,823 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:30,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:30,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:30,823 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:38:30,852 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:38:30,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:30,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:30,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:30,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:30,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:38:30,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:30,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:38:30,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:30,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:30,885 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:30,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:38:30,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:38:30,906 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 13 treesize of output 12 [2018-02-04 17:38:30,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 17:38:30,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 17:38:30,927 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 13 treesize of output 12 [2018-02-04 17:38:30,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:30,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:30,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-02-04 17:38:33,200 WARN L143 SmtUtils]: Spent 2045ms on a formula simplification that was a NOOP. DAG size: 38 [2018-02-04 17:38:33,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-02-04 17:38:33,260 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-02-04 17:38:33,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:33,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-02-04 17:38:33,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:33,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-02-04 17:38:33,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:33,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-02-04 17:38:33,357 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:33,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-02-04 17:38:33,401 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 17:38:33,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-02-04 17:38:33,469 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-04 17:38:33,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-02-04 17:38:33,546 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:33,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-02-04 17:38:33,548 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:33,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-02-04 17:38:33,549 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:33,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-02-04 17:38:33,615 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:33,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-02-04 17:38:33,617 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:33,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2018-02-04 17:38:33,680 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:33,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 17:38:33,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:38:33,755 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-02-04 17:38:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:33,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:33,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 17:38:33,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:38:33,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:38:33,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:38:33,819 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 19 states. [2018-02-04 17:38:35,141 WARN L146 SmtUtils]: Spent 963ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-02-04 17:38:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:35,452 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2018-02-04 17:38:35,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:38:35,453 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-04 17:38:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:35,453 INFO L225 Difference]: With dead ends: 163 [2018-02-04 17:38:35,453 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 17:38:35,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:38:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 17:38:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 140. [2018-02-04 17:38:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 17:38:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 166 transitions. [2018-02-04 17:38:35,457 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 166 transitions. Word has length 51 [2018-02-04 17:38:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:35,457 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 166 transitions. [2018-02-04 17:38:35,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:38:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 166 transitions. [2018-02-04 17:38:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 17:38:35,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:35,458 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:35,458 INFO L371 AbstractCegarLoop]: === Iteration 20 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash 813814599, now seen corresponding path program 3 times [2018-02-04 17:38:35,458 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:35,458 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:35,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:35,459 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:35,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:35,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 17:38:35,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:35,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:35,686 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:38:35,723 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:38:35,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:35,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:35,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:35,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:35,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:35,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:38:35,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:38:35,764 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 12 treesize of output 11 [2018-02-04 17:38:35,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:35,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:35,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:35,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 17:38:35,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-02-04 17:38:35,908 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-02-04 17:38:35,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:35,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-02-04 17:38:35,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:35,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-02-04 17:38:35,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-04 17:38:35,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 17:38:36,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:38:36,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:76 [2018-02-04 17:38:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 17:38:36,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:38:36,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2018-02-04 17:38:36,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:38:36,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:38:36,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:38:36,081 INFO L87 Difference]: Start difference. First operand 140 states and 166 transitions. Second operand 22 states. [2018-02-04 17:38:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:36,718 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2018-02-04 17:38:36,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:38:36,718 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-02-04 17:38:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:36,719 INFO L225 Difference]: With dead ends: 138 [2018-02-04 17:38:36,719 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 17:38:36,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=402, Invalid=1404, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:38:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 17:38:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2018-02-04 17:38:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 17:38:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-02-04 17:38:36,721 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 54 [2018-02-04 17:38:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:36,721 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-02-04 17:38:36,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:38:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-02-04 17:38:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 17:38:36,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:36,722 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:36,722 INFO L371 AbstractCegarLoop]: === Iteration 21 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1517420696, now seen corresponding path program 4 times [2018-02-04 17:38:36,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:36,722 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:36,723 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:36,723 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:36,723 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:36,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:36,752 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:36,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:36,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:36,753 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:38:36,781 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:38:36,781 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:36,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:36,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:36,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:36,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:38:36,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:36,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:36,833 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:36,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:38:36,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:38:36,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:38:36,863 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 13 treesize of output 12 [2018-02-04 17:38:36,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 17:38:36,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 17:38:36,897 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 13 treesize of output 12 [2018-02-04 17:38:36,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:36,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 17:38:37,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-02-04 17:38:37,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:38:37,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:37,252 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-02-04 17:38:37,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:37,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:37,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 17:38:37,266 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:72 [2018-02-04 17:38:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:37,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:37,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 17:38:37,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:38:37,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:38:37,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:38:37,352 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 24 states. [2018-02-04 17:38:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:38,206 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-02-04 17:38:38,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:38:38,206 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-04 17:38:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:38,206 INFO L225 Difference]: With dead ends: 131 [2018-02-04 17:38:38,207 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 17:38:38,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:38:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 17:38:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2018-02-04 17:38:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 17:38:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-02-04 17:38:38,209 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 62 [2018-02-04 17:38:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:38,209 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2018-02-04 17:38:38,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 17:38:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2018-02-04 17:38:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 17:38:38,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:38,210 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:38,211 INFO L371 AbstractCegarLoop]: === Iteration 22 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:38,211 INFO L82 PathProgramCache]: Analyzing trace with hash -616528119, now seen corresponding path program 5 times [2018-02-04 17:38:38,211 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:38,211 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:38,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:38,212 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:38,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:38,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:38,244 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:38,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:38,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:38,245 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:38:38,285 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 17:38:38,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:38:38,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:38,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:38,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,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 6 treesize of output 5 [2018-02-04 17:38:38,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:38:38,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:38,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:38,317 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:38,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:38:38,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:38:38,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:38:38,356 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 13 treesize of output 12 [2018-02-04 17:38:38,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 17:38:38,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 17:38:38,385 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 13 treesize of output 12 [2018-02-04 17:38:38,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 17:38:38,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2018-02-04 17:38:38,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-02-04 17:38:38,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,804 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-02-04 17:38:38,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,830 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-02-04 17:38:38,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-02-04 17:38:38,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:38,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-02-04 17:38:38,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-02-04 17:38:38,909 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-02-04 17:38:38,941 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-02-04 17:38:38,958 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:38,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-04 17:38:38,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 17:38:38,993 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:59, output treesize:111 [2018-02-04 17:38:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:39,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:39,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 17:38:39,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:38:39,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:38:39,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:38:39,064 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand 24 states. [2018-02-04 17:38:40,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:40,129 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-02-04 17:38:40,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:38:40,129 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-02-04 17:38:40,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:40,130 INFO L225 Difference]: With dead ends: 143 [2018-02-04 17:38:40,130 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 17:38:40,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:38:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 17:38:40,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2018-02-04 17:38:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 17:38:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-02-04 17:38:40,133 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 73 [2018-02-04 17:38:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:40,133 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2018-02-04 17:38:40,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 17:38:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2018-02-04 17:38:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 17:38:40,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:38:40,134 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:38:40,134 INFO L371 AbstractCegarLoop]: === Iteration 23 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:38:40,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1896391797, now seen corresponding path program 1 times [2018-02-04 17:38:40,134 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:38:40,134 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:38:40,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:40,135 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:38:40,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:38:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:40,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:38:40,163 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:38:40,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:38:40,164 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:38:40,164 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:38:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:38:40,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:38:40,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:40,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:38:40,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:38:40,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:40,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:38:40,228 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:38:40,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:38:40,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:38:40,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:38:40,264 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 12 treesize of output 11 [2018-02-04 17:38:40,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 17:38:40,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-02-04 17:38:40,283 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 13 treesize of output 12 [2018-02-04 17:38:40,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:38:40,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 17:38:40,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-02-04 17:38:40,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:38:40,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:38:40,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 17:38:40,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:38:40,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:40,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:38:40,560 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-02-04 17:38:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 66 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:38:40,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:38:40,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 17:38:40,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:38:40,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:38:40,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:38:40,662 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 20 states. [2018-02-04 17:38:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:38:42,632 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2018-02-04 17:38:42,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:38:42,632 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2018-02-04 17:38:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:38:42,633 INFO L225 Difference]: With dead ends: 151 [2018-02-04 17:38:42,633 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:38:42,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:38:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:38:42,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:38:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:38:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:38:42,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-02-04 17:38:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:38:42,633 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:38:42,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:38:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:38:42,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:38:42,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:38:42 BoogieIcfgContainer [2018-02-04 17:38:42,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:38:42,637 INFO L168 Benchmark]: Toolchain (without parser) took 29517.96 ms. Allocated memory was 402.7 MB in the beginning and 836.2 MB in the end (delta: 433.6 MB). Free memory was 360.8 MB in the beginning and 748.9 MB in the end (delta: -388.1 MB). Peak memory consumption was 45.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:42,638 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:38:42,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.42 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 349.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:42,638 INFO L168 Benchmark]: Boogie Preprocessor took 32.98 ms. Allocated memory is still 402.7 MB. Free memory was 349.0 MB in the beginning and 347.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:42,638 INFO L168 Benchmark]: RCFGBuilder took 207.93 ms. Allocated memory is still 402.7 MB. Free memory was 347.6 MB in the beginning and 327.0 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:42,639 INFO L168 Benchmark]: TraceAbstraction took 29117.15 ms. Allocated memory was 402.7 MB in the beginning and 836.2 MB in the end (delta: 433.6 MB). Free memory was 327.0 MB in the beginning and 748.9 MB in the end (delta: -421.9 MB). Peak memory consumption was 11.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:38:42,640 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.42 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 349.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.98 ms. Allocated memory is still 402.7 MB. Free memory was 349.0 MB in the beginning and 347.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 207.93 ms. Allocated memory is still 402.7 MB. Free memory was 347.6 MB in the beginning and 327.0 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 29117.15 ms. Allocated memory was 402.7 MB in the beginning and 836.2 MB in the end (delta: 433.6 MB). Free memory was 327.0 MB in the beginning and 748.9 MB in the end (delta: -421.9 MB). Peak memory consumption was 11.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. SAFE Result, 29.0s OverallTime, 23 OverallIterations, 6 TraceHistogramMax, 15.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 867 SDtfs, 1700 SDslu, 5140 SDs, 0 SdLazy, 6496 SolverSat, 334 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 909 GetRequests, 425 SyntacticMatches, 10 SemanticMatches, 474 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2984 ImplicationChecksByTransitivity, 19.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 225 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1395 NumberOfCodeBlocks, 1394 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 909 ConstructedInterpolants, 233 QuantifiedInterpolants, 813992 SizeOfPredicates, 189 NumberOfNonLiveVariables, 2663 ConjunctsInSsa, 633 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 115/569 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-38-42-645.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-38-42-645.csv Received shutdown request...