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/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:26:08,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:26:08,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:26:08,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:26:08,616 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:26:08,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:26:08,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:26:08,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:26:08,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:26:08,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:26:08,621 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:26:08,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:26:08,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:26:08,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:26:08,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:26:08,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:26:08,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:26:08,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:26:08,629 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:26:08,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:26:08,632 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:26:08,632 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:26:08,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:26:08,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:26:08,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:26:08,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:26:08,635 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:26:08,635 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:26:08,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:26:08,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:26:08,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:26:08,636 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:26:08,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:26:08,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:26:08,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:26:08,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:26:08,647 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:26:08,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:26:08,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:26:08,648 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:26:08,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:26:08,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:26:08,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:26:08,649 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:26:08,649 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:26:08,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:26:08,649 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:26:08,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:26:08,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:26:08,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:26:08,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:26:08,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:26:08,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:26:08,650 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:26:08,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:26:08,650 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:26:08,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:26:08,692 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:26:08,696 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:26:08,698 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:26:08,698 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:26:08,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:26:08,835 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:26:08,837 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:26:08,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:26:08,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:26:08,843 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:26:08,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:26:08" (1/1) ... [2018-02-04 17:26:08,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a67664e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08, skipping insertion in model container [2018-02-04 17:26:08,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:26:08" (1/1) ... [2018-02-04 17:26:08,861 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:26:08,888 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:26:08,969 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:26:08,980 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:26:08,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08 WrapperNode [2018-02-04 17:26:08,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:26:08,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:26:08,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:26:08,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:26:08,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08" (1/1) ... [2018-02-04 17:26:08,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08" (1/1) ... [2018-02-04 17:26:09,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08" (1/1) ... [2018-02-04 17:26:09,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08" (1/1) ... [2018-02-04 17:26:09,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08" (1/1) ... [2018-02-04 17:26:09,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08" (1/1) ... [2018-02-04 17:26:09,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08" (1/1) ... [2018-02-04 17:26:09,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:26:09,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:26:09,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:26:09,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:26:09,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08" (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:26:09,041 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:26:09,041 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:26:09,041 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-02-04 17:26:09,041 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:26:09,041 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:26:09,041 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:26:09,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:26:09,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:26:09,041 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:26:09,041 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:26:09,042 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-02-04 17:26:09,042 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:26:09,042 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:26:09,042 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:26:09,167 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:26:09,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:26:09 BoogieIcfgContainer [2018-02-04 17:26:09,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:26:09,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:26:09,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:26:09,170 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:26:09,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:26:08" (1/3) ... [2018-02-04 17:26:09,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3158c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:26:09, skipping insertion in model container [2018-02-04 17:26:09,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:26:08" (2/3) ... [2018-02-04 17:26:09,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3158c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:26:09, skipping insertion in model container [2018-02-04 17:26:09,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:26:09" (3/3) ... [2018-02-04 17:26:09,173 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:26:09,179 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:26:09,184 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-04 17:26:09,217 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:26:09,217 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:26:09,217 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:26:09,218 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:26:09,218 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:26:09,218 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:26:09,218 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:26:09,218 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:26:09,219 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:26:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-04 17:26:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:26:09,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:09,237 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:09,237 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:09,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1122979584, now seen corresponding path program 1 times [2018-02-04 17:26:09,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:09,241 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:09,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:09,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:09,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:09,344 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:26:09,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:09,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:26:09,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:26:09,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:26:09,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:26:09,356 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-02-04 17:26:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:09,413 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 17:26:09,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:26:09,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 17:26:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:09,420 INFO L225 Difference]: With dead ends: 41 [2018-02-04 17:26:09,420 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 17:26:09,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:26:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 17:26:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 17:26:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 17:26:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 17:26:09,490 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-04 17:26:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:09,490 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 17:26:09,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:26:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 17:26:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:26:09,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:09,491 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:09,491 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226348, now seen corresponding path program 1 times [2018-02-04 17:26:09,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:09,491 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:09,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,492 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:09,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:09,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:09,522 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:26:09,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:09,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:26:09,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:26:09,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:26:09,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:26:09,523 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-04 17:26:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:09,580 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 17:26:09,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:26:09,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:26:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:09,581 INFO L225 Difference]: With dead ends: 36 [2018-02-04 17:26:09,581 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:26:09,582 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:26:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:26:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:26:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:26:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:26:09,586 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-04 17:26:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:09,586 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:26:09,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:26:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:26:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:26:09,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:09,587 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:09,587 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:09,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226347, now seen corresponding path program 1 times [2018-02-04 17:26:09,587 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:09,587 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:09,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,588 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:09,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:09,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:09,675 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:26:09,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:09,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:26:09,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:26:09,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:26:09,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:26:09,676 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 17:26:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:09,716 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 17:26:09,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:26:09,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:26:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:09,717 INFO L225 Difference]: With dead ends: 35 [2018-02-04 17:26:09,718 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 17:26:09,718 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:26:09,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 17:26:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 17:26:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:26:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 17:26:09,721 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-04 17:26:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:09,722 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 17:26:09,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:26:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 17:26:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:26:09,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:09,723 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:26:09,723 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:09,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633306, now seen corresponding path program 1 times [2018-02-04 17:26:09,723 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:09,723 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:09,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:09,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:09,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:09,769 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:26:09,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:09,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:26:09,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:26:09,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:26:09,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:26:09,771 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-04 17:26:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:09,809 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 17:26:09,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:26:09,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 17:26:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:09,810 INFO L225 Difference]: With dead ends: 34 [2018-02-04 17:26:09,810 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 17:26:09,810 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:26:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 17:26:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 17:26:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 17:26:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-04 17:26:09,812 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-02-04 17:26:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:09,812 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-04 17:26:09,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:26:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-04 17:26:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:26:09,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:09,813 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:26:09,813 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633307, now seen corresponding path program 1 times [2018-02-04 17:26:09,813 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:09,813 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:09,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,814 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:09,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:09,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:09,882 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:26:09,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:09,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:26:09,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:26:09,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:26:09,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:26:09,883 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-02-04 17:26:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:09,969 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 17:26:09,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:26:09,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 17:26:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:09,971 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:26:09,971 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 17:26:09,971 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:26:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 17:26:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-02-04 17:26:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:26:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:26:09,974 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-02-04 17:26:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:09,974 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:26:09,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:26:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:26:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:26:09,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:09,974 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:09,974 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash -429040459, now seen corresponding path program 1 times [2018-02-04 17:26:09,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:09,975 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:09,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:09,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:09,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:09,995 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:09,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:09,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:09,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:10,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:10,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:26:10,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:26:10,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:26:10,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,064 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:26:10,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:26:10,082 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:26:10,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:10,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:26:10,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:26:10,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:26:10,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:26:10,083 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 6 states. [2018-02-04 17:26:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:10,132 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 17:26:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:26:10,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 17:26:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:10,133 INFO L225 Difference]: With dead ends: 35 [2018-02-04 17:26:10,133 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 17:26:10,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:26:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 17:26:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 17:26:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:26:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 17:26:10,136 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-02-04 17:26:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:10,136 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 17:26:10,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:26:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 17:26:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:26:10,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:10,137 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:10,137 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:10,138 INFO L82 PathProgramCache]: Analyzing trace with hash -429040458, now seen corresponding path program 1 times [2018-02-04 17:26:10,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:10,138 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:10,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:10,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:10,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:10,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:10,154 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:10,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:10,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:10,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:10,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:10,194 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:26:10,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,200 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:26:10,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-02-04 17:26:10,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:10,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:10,232 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:26:10,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,259 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:26:10,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-02-04 17:26:10,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:26:10,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:28 [2018-02-04 17:26:10,412 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:26:10,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:10,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 17:26:10,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:26:10,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:26:10,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:26:10,413 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2018-02-04 17:26:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:10,761 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-02-04 17:26:10,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:26:10,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-02-04 17:26:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:10,762 INFO L225 Difference]: With dead ends: 70 [2018-02-04 17:26:10,762 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 17:26:10,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:26:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 17:26:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2018-02-04 17:26:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 17:26:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-04 17:26:10,767 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 19 [2018-02-04 17:26:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:10,767 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-04 17:26:10,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:26:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-04 17:26:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:26:10,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:10,768 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:10,768 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1015846472, now seen corresponding path program 1 times [2018-02-04 17:26:10,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:10,768 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:10,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:10,769 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:10,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:10,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:10,782 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:10,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:10,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:10,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:10,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:10,828 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:26:10,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,833 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:26:10,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:10,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:10,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:10,852 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:26:10,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,857 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:26:10,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:10,862 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:26:10,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-02-04 17:26:10,879 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:26:10,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:10,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:26:10,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:26:10,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:26:10,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:26:10,880 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 8 states. [2018-02-04 17:26:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:10,963 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-02-04 17:26:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:26:10,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 17:26:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:10,964 INFO L225 Difference]: With dead ends: 66 [2018-02-04 17:26:10,965 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 17:26:10,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:26:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 17:26:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 36. [2018-02-04 17:26:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:26:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:26:10,968 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-02-04 17:26:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:10,968 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:26:10,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:26:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:26:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:26:10,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:10,969 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] [2018-02-04 17:26:10,969 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash 39867865, now seen corresponding path program 1 times [2018-02-04 17:26:10,969 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:10,969 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:10,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:10,970 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:10,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:10,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:11,052 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:26:11,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:11,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 17:26:11,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:26:11,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:26:11,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:26:11,053 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-02-04 17:26:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:11,209 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-02-04 17:26:11,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:26:11,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 17:26:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:11,210 INFO L225 Difference]: With dead ends: 74 [2018-02-04 17:26:11,210 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 17:26:11,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:26:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 17:26:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-02-04 17:26:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 17:26:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 17:26:11,219 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2018-02-04 17:26:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:11,219 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 17:26:11,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:26:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 17:26:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:26:11,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:11,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] [2018-02-04 17:26:11,220 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1548480037, now seen corresponding path program 1 times [2018-02-04 17:26:11,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:11,220 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:11,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:11,221 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:11,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:11,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:11,376 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:26:11,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:11,376 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:11,377 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:11,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:11,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:26:11,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:26:11,447 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:26:11,448 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:26:11,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:26:11,503 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:26:11,507 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:26:11,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:11,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:11,517 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:26:11,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:26:11,572 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:26:11,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:26:11,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 17:26:11,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:26:11,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:26:11,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:26:11,574 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 18 states. [2018-02-04 17:26:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:11,823 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-04 17:26:11,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:26:11,823 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-02-04 17:26:11,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:11,824 INFO L225 Difference]: With dead ends: 66 [2018-02-04 17:26:11,824 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 17:26:11,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:26:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 17:26:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-02-04 17:26:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 17:26:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-04 17:26:11,827 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-02-04 17:26:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:11,827 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-04 17:26:11,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:26:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-04 17:26:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:26:11,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:11,828 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:11,828 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:11,828 INFO L82 PathProgramCache]: Analyzing trace with hash -758240906, now seen corresponding path program 1 times [2018-02-04 17:26:11,828 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:11,828 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:11,829 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:11,829 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:11,829 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:11,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:11,840 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:11,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:11,841 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:11,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:11,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:11,874 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:26:11,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,881 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:26:11,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:11,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:11,903 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:26:11,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:11,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:11,914 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:26:11,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 17:26:11,939 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:26:11,940 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:26:11,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:11,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 17:26:12,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 20 treesize of output 16 [2018-02-04 17:26:12,013 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:26:12,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:12,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:12,027 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:26:12,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:49 [2018-02-04 17:26:12,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:12,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:12,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 17:26:12,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:26:12,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:26:12,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:26:12,128 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 14 states. [2018-02-04 17:26:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:12,549 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-02-04 17:26:12,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:26:12,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-02-04 17:26:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:12,550 INFO L225 Difference]: With dead ends: 65 [2018-02-04 17:26:12,550 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 17:26:12,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:26:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 17:26:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-02-04 17:26:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 17:26:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-04 17:26:12,554 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 24 [2018-02-04 17:26:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:12,554 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-04 17:26:12,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:26:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-04 17:26:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:26:12,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:12,555 INFO L351 BasicCegarLoop]: trace histogram [3, 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:26:12,555 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash 67945113, now seen corresponding path program 2 times [2018-02-04 17:26:12,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:12,556 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:12,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:12,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:12,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:12,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:12,576 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:12,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:12,576 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:12,576 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:26:12,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:26:12,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:12,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:12,610 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:26:12,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:26:12,619 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:26:12,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:12,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:12,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:26:12,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 17:26:12,642 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:26:12,643 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:26:12,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-04 17:26:12,687 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 23 treesize of output 24 [2018-02-04 17:26:12,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:26:12,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:12,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-02-04 17:26:12,717 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:26:12,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:26:12,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:12,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:12,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:12,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:40 [2018-02-04 17:26:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:12,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:12,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 17:26:12,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:26:12,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:26:12,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:26:12,779 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 15 states. [2018-02-04 17:26:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:12,986 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-04 17:26:12,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:26:12,987 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-02-04 17:26:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:12,987 INFO L225 Difference]: With dead ends: 71 [2018-02-04 17:26:12,987 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 17:26:12,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:26:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 17:26:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2018-02-04 17:26:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 17:26:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 17:26:12,990 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 28 [2018-02-04 17:26:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:12,991 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 17:26:12,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:26:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 17:26:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:26:12,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:12,992 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] [2018-02-04 17:26:12,992 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:12,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1163981862, now seen corresponding path program 1 times [2018-02-04 17:26:12,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:12,992 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:12,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:12,993 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:12,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:13,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:13,007 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:13,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:13,008 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:13,008 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:13,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:13,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:13,059 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:26:13,062 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:26:13,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,067 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:26:13,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:26:13,088 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |c_main_#t~malloc7.base|)) (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc7.base| 1) |main_#t~malloc6.base| 0))))) is different from true [2018-02-04 17:26:13,096 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int) (|main_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |main_#t~malloc7.base|)) (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= (store (store (store .cse0 |main_#t~malloc7.base| 1) |main_#t~malloc6.base| 0) |main_#t~malloc7.base| 0) |c_#valid|)))) is different from true [2018-02-04 17:26:13,098 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:26:13,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:26:13,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:26:13,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:26:13,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:26:13,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=41, Unknown=2, NotChecked=26, Total=90 [2018-02-04 17:26:13,099 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 10 states. [2018-02-04 17:26:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:13,152 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-02-04 17:26:13,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:26:13,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-02-04 17:26:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:13,152 INFO L225 Difference]: With dead ends: 62 [2018-02-04 17:26:13,152 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 17:26:13,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=53, Unknown=2, NotChecked=30, Total=110 [2018-02-04 17:26:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 17:26:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 17:26:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:26:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-02-04 17:26:13,154 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 29 [2018-02-04 17:26:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:13,154 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-02-04 17:26:13,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:26:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-02-04 17:26:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:26:13,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:13,155 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:13,155 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:13,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2106298488, now seen corresponding path program 2 times [2018-02-04 17:26:13,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:13,155 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:13,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:13,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:13,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:13,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:13,175 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:13,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:13,176 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:13,176 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:26:13,194 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:26:13,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:13,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:13,206 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:26:13,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,211 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:26:13,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:13,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:13,230 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:26:13,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:13,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:13,238 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:26:13,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:13,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:13,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 17:26:13,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:26:13,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:26:13,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:26:13,329 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2018-02-04 17:26:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:13,524 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-04 17:26:13,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:26:13,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-02-04 17:26:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:13,524 INFO L225 Difference]: With dead ends: 38 [2018-02-04 17:26:13,524 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:26:13,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:26:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:26:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-02-04 17:26:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:26:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-04 17:26:13,526 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-02-04 17:26:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:13,526 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-04 17:26:13,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:26:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-04 17:26:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:26:13,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:13,530 INFO L351 BasicCegarLoop]: trace histogram [4, 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:26:13,530 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1277503333, now seen corresponding path program 3 times [2018-02-04 17:26:13,530 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:13,530 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:13,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:13,531 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:13,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:13,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:13,552 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:13,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:13,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:13,552 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:26:13,586 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:26:13,586 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:13,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:13,598 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:26:13,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:26:13,614 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:26:13,615 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:26:13,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-02-04 17:26:13,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-02-04 17:26:13,679 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 24 treesize of output 23 [2018-02-04 17:26:13,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-04 17:26:13,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:13,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:13,720 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:26:13,720 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:39 [2018-02-04 17:26:13,781 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 26 treesize of output 23 [2018-02-04 17:26:13,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 9 [2018-02-04 17:26:13,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 44 [2018-02-04 17:26:13,826 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 33 treesize of output 32 [2018-02-04 17:26:13,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 39 [2018-02-04 17:26:13,855 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:13,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:13,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:26:13,898 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:59, output treesize:54 [2018-02-04 17:26:13,951 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 17:26:13,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:13,979 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:26:13,988 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:26:13,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:13,992 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:13,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:13,998 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:95, output treesize:34 [2018-02-04 17:26:14,047 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:26:14,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:14,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:26:14,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:26:14,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:26:14,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:26:14,048 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 16 states. [2018-02-04 17:26:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:14,222 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-04 17:26:14,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:26:14,224 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-02-04 17:26:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:14,225 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:26:14,225 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 17:26:14,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:26:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 17:26:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-02-04 17:26:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:26:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-04 17:26:14,226 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 33 [2018-02-04 17:26:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:14,226 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-04 17:26:14,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:26:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-04 17:26:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 17:26:14,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:14,227 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:14,227 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:14,227 INFO L82 PathProgramCache]: Analyzing trace with hash -947897674, now seen corresponding path program 3 times [2018-02-04 17:26:14,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:14,227 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:14,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:14,228 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:14,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:14,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:14,242 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:14,242 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:14,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:14,243 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:26:14,273 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:26:14,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:14,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:14,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:26:14,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:26:14,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:26:14,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:14,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:26:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:14,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:14,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 17:26:14,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:26:14,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:26:14,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:26:14,472 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 14 states. [2018-02-04 17:26:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:14,723 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 17:26:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:26:14,723 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-04 17:26:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:14,723 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:26:14,724 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 17:26:14,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:26:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 17:26:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-02-04 17:26:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:26:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-02-04 17:26:14,725 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 34 [2018-02-04 17:26:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:14,725 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-02-04 17:26:14,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:26:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-02-04 17:26:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:26:14,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:14,726 INFO L351 BasicCegarLoop]: trace histogram [5, 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:26:14,726 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:14,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1121203161, now seen corresponding path program 4 times [2018-02-04 17:26:14,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:14,726 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:14,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:14,727 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:14,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:14,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:14,753 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:14,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:14,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:14,754 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:26:14,784 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:26:14,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:14,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:14,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:26:14,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:26:14,798 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:26:14,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:14,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:14,805 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:26:14,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 17:26:14,826 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:26:14,828 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:26:14,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-04 17:26:14,901 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 24 treesize of output 25 [2018-02-04 17:26:14,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:26:14,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:26:14,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-02-04 17:26:14,954 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 24 treesize of output 25 [2018-02-04 17:26:14,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:26:14,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:14,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:26:14,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2018-02-04 17:26:15,000 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 24 treesize of output 25 [2018-02-04 17:26:15,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:26:15,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:15,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:15,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:26:15,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:24 [2018-02-04 17:26:15,056 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:26:15,061 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:26:15,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:15,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:15,071 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:26:15,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:50 [2018-02-04 17:26:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:15,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:15,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:26:15,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:26:15,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:26:15,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:26:15,144 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 17 states. [2018-02-04 17:26:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:15,470 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-04 17:26:15,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:26:15,471 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-02-04 17:26:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:15,471 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:26:15,471 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:26:15,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:26:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:26:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-02-04 17:26:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:26:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-04 17:26:15,472 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 38 [2018-02-04 17:26:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:15,473 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-04 17:26:15,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:26:15,473 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-04 17:26:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 17:26:15,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:15,473 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:15,473 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:15,473 INFO L82 PathProgramCache]: Analyzing trace with hash 397559608, now seen corresponding path program 4 times [2018-02-04 17:26:15,474 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:15,474 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:15,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:15,474 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:15,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:15,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:15,494 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:15,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:15,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:15,495 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:26:15,519 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:26:15,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:15,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:15,531 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:26:15,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:15,538 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:26:15,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:15,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:15,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:15,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:15,564 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:26:15,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:15,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:15,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:15,576 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:26:15,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:15,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:15,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:26:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:15,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:15,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:26:15,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:26:15,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:26:15,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:26:15,723 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2018-02-04 17:26:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:15,984 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-04 17:26:15,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:26:15,985 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-04 17:26:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:15,985 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:26:15,985 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:26:15,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:26:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:26:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-02-04 17:26:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:26:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-04 17:26:15,987 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 39 [2018-02-04 17:26:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:15,987 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-04 17:26:15,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:26:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-04 17:26:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 17:26:15,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:15,988 INFO L351 BasicCegarLoop]: trace histogram [6, 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:26:15,988 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:15,988 INFO L82 PathProgramCache]: Analyzing trace with hash -632803493, now seen corresponding path program 5 times [2018-02-04 17:26:15,988 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:15,988 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:15,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:15,989 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:15,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:15,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:16,007 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:16,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:16,007 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:16,008 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:26:16,043 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 17:26:16,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:16,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:16,048 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:26:16,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:26:16,054 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:26:16,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:16,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:16,061 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:26:16,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-02-04 17:26:16,084 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:26:16,085 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:26:16,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-02-04 17:26:16,151 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 23 treesize of output 24 [2018-02-04 17:26:16,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:26:16,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2018-02-04 17:26:16,188 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 23 treesize of output 24 [2018-02-04 17:26:16,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:26:16,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-02-04 17:26:16,222 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 23 treesize of output 24 [2018-02-04 17:26:16,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:26:16,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-02-04 17:26:16,253 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 23 treesize of output 24 [2018-02-04 17:26:16,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:26:16,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-02-04 17:26:16,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-02-04 17:26:16,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-02-04 17:26:16,308 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:26:16,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:16,312 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:16,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:26:16,321 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-02-04 17:26:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 17:26:16,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:16,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:26:16,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:26:16,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:26:16,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:26:16,381 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 16 states. [2018-02-04 17:26:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:16,755 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-04 17:26:16,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:26:16,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-04 17:26:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:16,756 INFO L225 Difference]: With dead ends: 45 [2018-02-04 17:26:16,756 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:26:16,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:26:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:26:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 17:26:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:26:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-04 17:26:16,757 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-02-04 17:26:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:16,758 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-04 17:26:16,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:26:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-04 17:26:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 17:26:16,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:16,758 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:16,758 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:16,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1857928182, now seen corresponding path program 5 times [2018-02-04 17:26:16,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:16,758 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:16,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:16,759 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:16,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:16,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:16,784 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:16,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:16,784 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:16,785 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:26:16,814 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 17:26:16,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:16,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:16,833 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:26:16,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:26:16,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:26:16,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:16,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:16,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:26:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:16,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:16,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:26:16,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:26:16,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:26:16,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:26:16,995 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2018-02-04 17:26:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:17,302 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-02-04 17:26:17,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:26:17,302 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-02-04 17:26:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:17,303 INFO L225 Difference]: With dead ends: 52 [2018-02-04 17:26:17,303 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 17:26:17,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:26:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 17:26:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-02-04 17:26:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:26:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-04 17:26:17,304 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2018-02-04 17:26:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:17,304 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-04 17:26:17,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:26:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-04 17:26:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 17:26:17,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:17,305 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:17,305 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash -51147272, now seen corresponding path program 6 times [2018-02-04 17:26:17,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:17,305 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:17,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:17,305 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:17,306 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:17,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:17,324 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:17,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:17,325 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:17,325 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:26:17,377 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 17:26:17,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:17,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:17,390 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:26:17,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:17,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:26:17,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:17,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:17,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:17,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:17,421 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:26:17,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:17,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:17,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:17,434 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:26:17,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:17,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:17,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:17,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:17,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:26:17,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:26:17,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:26:17,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:26:17,712 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-02-04 17:26:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:18,065 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-04 17:26:18,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:26:18,065 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-02-04 17:26:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:18,065 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:26:18,065 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 17:26:18,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:26:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 17:26:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-02-04 17:26:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 17:26:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-02-04 17:26:18,067 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 49 [2018-02-04 17:26:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:18,067 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-02-04 17:26:18,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:26:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-02-04 17:26:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 17:26:18,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:18,067 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:18,067 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1694149942, now seen corresponding path program 7 times [2018-02-04 17:26:18,067 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:18,068 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:18,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:18,068 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:18,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:18,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:18,087 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:18,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:18,088 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:18,088 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:18,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:18,121 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:26:18,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,126 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:26:18,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:18,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:18,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:18,143 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:26:18,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,148 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:26:18,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:26:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:18,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:18,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 17:26:18,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:26:18,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:26:18,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:26:18,395 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 19 states. [2018-02-04 17:26:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:18,768 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-02-04 17:26:18,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:26:18,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-02-04 17:26:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:18,769 INFO L225 Difference]: With dead ends: 62 [2018-02-04 17:26:18,769 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 17:26:18,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:26:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 17:26:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-02-04 17:26:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:26:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-04 17:26:18,771 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 54 [2018-02-04 17:26:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:18,771 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-04 17:26:18,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:26:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-04 17:26:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 17:26:18,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:18,772 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:18,772 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:18,772 INFO L82 PathProgramCache]: Analyzing trace with hash 962290872, now seen corresponding path program 8 times [2018-02-04 17:26:18,772 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:18,772 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:18,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:18,773 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:18,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:18,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:18,788 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:18,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:18,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:18,789 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:26:18,824 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:26:18,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:18,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:18,833 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:26:18,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,838 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:26:18,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:18,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:18,855 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:26:18,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:18,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:18,865 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:26:18,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:18,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-02-04 17:26:19,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:26:19,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:19,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:19,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-02-04 17:26:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:19,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:19,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:26:19,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:26:19,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:26:19,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:26:19,299 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 21 states. [2018-02-04 17:26:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:20,041 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-04 17:26:20,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:26:20,041 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-02-04 17:26:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:20,042 INFO L225 Difference]: With dead ends: 67 [2018-02-04 17:26:20,042 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 17:26:20,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:26:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 17:26:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-02-04 17:26:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 17:26:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-02-04 17:26:20,044 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 59 [2018-02-04 17:26:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:20,044 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-02-04 17:26:20,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:26:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-02-04 17:26:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 17:26:20,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:20,045 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:20,045 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:20,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1168838262, now seen corresponding path program 9 times [2018-02-04 17:26:20,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:20,046 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:20,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:20,046 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:20,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:20,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:20,089 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:20,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:20,090 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:20,090 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:26:20,161 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 17:26:20,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:20,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:20,183 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:26:20,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:20,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:26:20,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:20,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:20,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:20,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:20,212 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:26:20,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:20,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:20,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:20,222 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:26:20,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:20,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:20,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:26:20,417 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 5 treesize of output 1 [2018-02-04 17:26:20,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:20,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:20,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-02-04 17:26:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:20,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:20,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:26:20,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:26:20,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:26:20,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:26:20,535 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 21 states. [2018-02-04 17:26:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:21,244 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-02-04 17:26:21,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:26:21,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 17:26:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:21,245 INFO L225 Difference]: With dead ends: 72 [2018-02-04 17:26:21,246 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 17:26:21,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:26:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 17:26:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-02-04 17:26:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:26:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-02-04 17:26:21,247 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 64 [2018-02-04 17:26:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:21,248 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-02-04 17:26:21,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:26:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-02-04 17:26:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 17:26:21,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:21,248 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:21,248 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:21,248 INFO L82 PathProgramCache]: Analyzing trace with hash 972409720, now seen corresponding path program 10 times [2018-02-04 17:26:21,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:21,248 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:21,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:21,249 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:21,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:21,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:21,264 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:21,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:21,264 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:21,265 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:26:21,333 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:26:21,334 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:21,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:21,345 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:26:21,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:21,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:26:21,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:21,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:21,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:21,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:21,374 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:26:21,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:21,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:21,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:21,382 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:26:21,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:21,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:21,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:21,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:21,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:26:21,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:26:21,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:26:21,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:26:21,708 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 21 states. [2018-02-04 17:26:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:22,250 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-02-04 17:26:22,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:26:22,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-02-04 17:26:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:22,250 INFO L225 Difference]: With dead ends: 77 [2018-02-04 17:26:22,250 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 17:26:22,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:26:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 17:26:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-04 17:26:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 17:26:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-02-04 17:26:22,252 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 69 [2018-02-04 17:26:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:22,252 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-02-04 17:26:22,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:26:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-02-04 17:26:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 17:26:22,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:22,253 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:22,253 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash -347938890, now seen corresponding path program 11 times [2018-02-04 17:26:22,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:22,253 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:22,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:22,254 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:22,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:22,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:22,311 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:22,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:22,311 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:22,312 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:26:22,354 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:26:22,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:22,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:22,374 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:26:22,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:22,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:22,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:26:22,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:26:22,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:22,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:22,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:26:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:22,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:22,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:26:22,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:26:22,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:26:22,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:26:22,678 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 21 states. [2018-02-04 17:26:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:23,163 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-02-04 17:26:23,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:26:23,164 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2018-02-04 17:26:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:23,164 INFO L225 Difference]: With dead ends: 82 [2018-02-04 17:26:23,164 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 17:26:23,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:26:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 17:26:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-02-04 17:26:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 17:26:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-02-04 17:26:23,166 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 74 [2018-02-04 17:26:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:23,166 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-02-04 17:26:23,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:26:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-02-04 17:26:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 17:26:23,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:23,167 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:23,167 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1932606920, now seen corresponding path program 12 times [2018-02-04 17:26:23,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:23,167 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:23,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:23,168 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:23,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:23,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:23,233 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:23,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:23,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:23,233 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:26:23,348 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 17:26:23,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:23,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:23,364 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:26:23,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:23,370 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:26:23,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:23,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:23,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:23,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:23,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:23,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:26:23,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:23,405 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:26:23,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:23,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:23,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:23,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:23,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 17:26:23,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:26:23,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:26:23,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:26:23,703 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 23 states. [2018-02-04 17:26:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:24,438 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-02-04 17:26:24,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:26:24,439 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-02-04 17:26:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:24,439 INFO L225 Difference]: With dead ends: 87 [2018-02-04 17:26:24,439 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 17:26:24,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:26:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 17:26:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-02-04 17:26:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 17:26:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-02-04 17:26:24,442 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 79 [2018-02-04 17:26:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:24,442 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-02-04 17:26:24,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:26:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-02-04 17:26:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 17:26:24,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:24,444 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:24,445 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1355407114, now seen corresponding path program 13 times [2018-02-04 17:26:24,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:24,445 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:24,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:24,446 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:24,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:24,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:24,521 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:24,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:24,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:24,522 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:24,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:24,579 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:26:24,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:24,584 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:26:24,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:24,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:24,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:24,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:24,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:24,601 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:26:24,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:24,607 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:26:24,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:24,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:24,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:24,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:24,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 17:26:24,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:26:24,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:26:24,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:26:24,942 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 24 states. [2018-02-04 17:26:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:25,712 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-02-04 17:26:25,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:26:25,713 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2018-02-04 17:26:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:25,713 INFO L225 Difference]: With dead ends: 92 [2018-02-04 17:26:25,713 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 17:26:25,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:26:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 17:26:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-02-04 17:26:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 17:26:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-02-04 17:26:25,716 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 84 [2018-02-04 17:26:25,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:25,716 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-02-04 17:26:25,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 17:26:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-02-04 17:26:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 17:26:25,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:25,717 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:25,717 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:25,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1594734344, now seen corresponding path program 14 times [2018-02-04 17:26:25,717 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:25,717 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:25,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:25,718 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:25,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:25,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:25,832 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:25,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:25,832 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:25,833 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:26:25,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:26:25,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:25,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:25,976 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:26:25,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:25,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:26:25,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:25,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:25,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:26,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:26,005 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:26:26,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:26,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:26,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:26,017 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:26:26,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:26,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:26,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:26,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:26,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 17:26:26,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:26:26,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:26:26,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:26:26,479 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 25 states. [2018-02-04 17:26:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:27,333 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-02-04 17:26:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:26:27,333 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 89 [2018-02-04 17:26:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:27,334 INFO L225 Difference]: With dead ends: 97 [2018-02-04 17:26:27,334 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 17:26:27,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=1922, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 17:26:27,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 17:26:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-04 17:26:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 17:26:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-02-04 17:26:27,336 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 89 [2018-02-04 17:26:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:27,336 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-02-04 17:26:27,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:26:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-02-04 17:26:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 17:26:27,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:27,337 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:27,337 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:27,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1443311050, now seen corresponding path program 15 times [2018-02-04 17:26:27,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:27,337 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:27,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:27,337 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:27,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:27,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:27,433 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:27,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:27,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:27,434 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:26:27,578 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 17:26:27,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:27,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:27,603 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:26:27,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:27,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:27,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:26:27,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:26:27,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:27,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:27,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:26:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:27,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:27,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 17:26:27,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:26:27,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:26:27,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:26:27,959 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 27 states. [2018-02-04 17:26:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:28,756 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-02-04 17:26:28,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:26:28,756 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 94 [2018-02-04 17:26:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:28,757 INFO L225 Difference]: With dead ends: 102 [2018-02-04 17:26:28,757 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 17:26:28,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=2287, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:26:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 17:26:28,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-04 17:26:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 17:26:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-02-04 17:26:28,760 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 94 [2018-02-04 17:26:28,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:28,760 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-02-04 17:26:28,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:26:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-02-04 17:26:28,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 17:26:28,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:28,761 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:28,761 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:28,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2039717960, now seen corresponding path program 16 times [2018-02-04 17:26:28,761 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:28,761 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:28,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:28,762 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:28,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:28,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:28,791 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:28,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:28,792 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:28,792 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:26:28,903 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:26:28,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:28,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:28,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 6 treesize of output 5 [2018-02-04 17:26:28,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:28,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:26:28,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:28,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:28,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:28,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:28,959 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:26:28,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:28,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:28,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:28,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:26:28,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:28,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:28,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:29,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:29,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 17:26:29,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:26:29,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:26:29,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:26:29,340 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 27 states. [2018-02-04 17:26:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:30,306 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-02-04 17:26:30,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:26:30,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2018-02-04 17:26:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:30,306 INFO L225 Difference]: With dead ends: 107 [2018-02-04 17:26:30,306 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 17:26:30,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=2290, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:26:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 17:26:30,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-02-04 17:26:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 17:26:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-02-04 17:26:30,309 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 99 [2018-02-04 17:26:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:30,310 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-02-04 17:26:30,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:26:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-02-04 17:26:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 17:26:30,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:30,311 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:30,311 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash -218172554, now seen corresponding path program 17 times [2018-02-04 17:26:30,311 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:30,311 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:30,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:30,312 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:30,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:30,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:30,363 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:30,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:30,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:30,363 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:26:30,530 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 17:26:30,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:30,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:30,544 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:26:30,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:30,549 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:26:30,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:30,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:30,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:30,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:30,567 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:26:30,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:30,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:30,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:30,577 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:26:30,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:30,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:30,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-02-04 17:26:30,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-02-04 17:26:30,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:30,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:30,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-02-04 17:26:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:31,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:31,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 17:26:31,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 17:26:31,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 17:26:31,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:26:31,025 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 28 states. [2018-02-04 17:26:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:32,093 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-02-04 17:26:32,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:26:32,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2018-02-04 17:26:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:32,094 INFO L225 Difference]: With dead ends: 112 [2018-02-04 17:26:32,094 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 17:26:32,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=2389, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:26:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 17:26:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-04 17:26:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 17:26:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-02-04 17:26:32,097 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 104 [2018-02-04 17:26:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:32,097 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-02-04 17:26:32,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 17:26:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-02-04 17:26:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 17:26:32,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:32,098 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:32,098 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:32,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1370945928, now seen corresponding path program 18 times [2018-02-04 17:26:32,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:32,099 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:32,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:32,099 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:32,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:32,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:32,168 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:32,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:32,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:32,169 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:26:32,493 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 17:26:32,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:32,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:32,518 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:26:32,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:32,524 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:26:32,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:32,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:32,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:32,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:32,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:32,543 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:26:32,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:32,550 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:26:32,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:32,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:32,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:33,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:33,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 17:26:33,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:26:33,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:26:33,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:26:33,016 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 29 states. [2018-02-04 17:26:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:34,105 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-02-04 17:26:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:26:34,105 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-02-04 17:26:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:34,106 INFO L225 Difference]: With dead ends: 117 [2018-02-04 17:26:34,106 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 17:26:34,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 17:26:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 17:26:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-02-04 17:26:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 17:26:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-02-04 17:26:34,108 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 109 [2018-02-04 17:26:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:34,108 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-02-04 17:26:34,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:26:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-02-04 17:26:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 17:26:34,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:34,109 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:34,109 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash -524516170, now seen corresponding path program 19 times [2018-02-04 17:26:34,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:34,109 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:34,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:34,110 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:34,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:34,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:34,226 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:34,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:34,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:34,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:34,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:34,353 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:26:34,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:34,359 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:26:34,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:34,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:34,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:34,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:34,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:34,375 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:26:34,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:34,381 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:26:34,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:34,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:34,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:35,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:35,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 17:26:35,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 17:26:35,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 17:26:35,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:26:35,049 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 30 states. [2018-02-04 17:26:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:36,360 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-02-04 17:26:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:26:36,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-02-04 17:26:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:36,361 INFO L225 Difference]: With dead ends: 122 [2018-02-04 17:26:36,361 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 17:26:36,361 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=2902, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:26:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 17:26:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-02-04 17:26:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 17:26:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-02-04 17:26:36,364 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 114 [2018-02-04 17:26:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:36,364 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-02-04 17:26:36,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 17:26:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-02-04 17:26:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 17:26:36,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:36,365 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:36,365 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1433125576, now seen corresponding path program 20 times [2018-02-04 17:26:36,365 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:36,365 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:36,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:36,365 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:36,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:36,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:36,455 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:36,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:36,455 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:36,455 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:26:36,587 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:26:36,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:36,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:36,604 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:26:36,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:36,611 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:26:36,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:36,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:36,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:36,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:36,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:36,634 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:26:36,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:36,641 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:26:36,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:36,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:36,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:26:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:37,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:37,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 17:26:37,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 17:26:37,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 17:26:37,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1052, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:26:37,319 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 34 states. [2018-02-04 17:26:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:38,712 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-02-04 17:26:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:26:38,712 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 119 [2018-02-04 17:26:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:38,712 INFO L225 Difference]: With dead ends: 127 [2018-02-04 17:26:38,712 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 17:26:38,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=214, Invalid=3818, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 17:26:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 17:26:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-02-04 17:26:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 17:26:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-02-04 17:26:38,715 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 119 [2018-02-04 17:26:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:38,715 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-02-04 17:26:38,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 17:26:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-02-04 17:26:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 17:26:38,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:38,715 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:38,715 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:38,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1218807286, now seen corresponding path program 21 times [2018-02-04 17:26:38,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:38,716 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:38,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:38,716 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:38,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:38,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:38,758 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:38,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:38,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:38,759 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:26:38,918 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 17:26:38,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:38,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:38,944 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:26:38,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:38,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:38,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:26:38,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:26:38,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:26:38,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:38,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:26:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:39,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:39,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 17:26:39,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 17:26:39,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 17:26:39,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:26:39,387 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 32 states. [2018-02-04 17:26:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:40,576 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-02-04 17:26:40,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:26:40,576 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 124 [2018-02-04 17:26:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:40,577 INFO L225 Difference]: With dead ends: 132 [2018-02-04 17:26:40,577 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 17:26:40,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=3350, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:26:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 17:26:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-02-04 17:26:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 17:26:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-02-04 17:26:40,579 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 124 [2018-02-04 17:26:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:40,579 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-02-04 17:26:40,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 17:26:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-02-04 17:26:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 17:26:40,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:40,580 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:40,580 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:40,580 INFO L82 PathProgramCache]: Analyzing trace with hash -296090632, now seen corresponding path program 22 times [2018-02-04 17:26:40,580 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:40,580 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:40,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:40,580 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:40,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:40,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:40,605 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:40,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:40,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:40,606 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:26:40,721 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:26:40,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:40,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:40,738 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:26:40,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:40,742 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:26:40,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:40,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:40,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:40,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:40,776 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:26:40,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:40,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:40,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:40,782 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:26:40,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:40,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:40,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:26:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:41,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:41,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 17:26:41,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 17:26:41,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 17:26:41,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:26:41,296 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 34 states. [2018-02-04 17:26:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:42,687 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-02-04 17:26:42,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:26:42,687 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 129 [2018-02-04 17:26:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:42,688 INFO L225 Difference]: With dead ends: 137 [2018-02-04 17:26:42,688 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 17:26:42,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=205, Invalid=3827, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 17:26:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 17:26:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-02-04 17:26:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 17:26:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-02-04 17:26:42,690 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 129 [2018-02-04 17:26:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:42,690 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-02-04 17:26:42,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 17:26:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-02-04 17:26:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 17:26:42,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:42,691 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:42,691 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1087506634, now seen corresponding path program 23 times [2018-02-04 17:26:42,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:42,691 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:42,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:42,692 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:42,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:42,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:42,772 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:42,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:42,772 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:42,772 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:26:42,943 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 17:26:42,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:42,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:42,961 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:26:42,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:42,966 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:26:42,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:42,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:42,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:42,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:42,983 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:26:42,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:42,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:42,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:42,993 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:26:42,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:43,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:43,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-02-04 17:26:43,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:26:43,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:43,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:43,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:43,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:43,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 17:26:43,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 17:26:43,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 17:26:43,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:26:43,647 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 34 states. [2018-02-04 17:26:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:45,235 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-02-04 17:26:45,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 17:26:45,235 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 134 [2018-02-04 17:26:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:45,235 INFO L225 Difference]: With dead ends: 142 [2018-02-04 17:26:45,236 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 17:26:45,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=3709, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:26:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 17:26:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-02-04 17:26:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 17:26:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-02-04 17:26:45,238 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 134 [2018-02-04 17:26:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:45,239 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-02-04 17:26:45,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 17:26:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-02-04 17:26:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 17:26:45,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:45,240 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:45,240 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1918477640, now seen corresponding path program 24 times [2018-02-04 17:26:45,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:45,240 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:45,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:45,241 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:45,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:45,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:45,296 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:45,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:45,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:45,297 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:26:45,556 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 17:26:45,556 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:45,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:45,586 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:26:45,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:45,592 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:26:45,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:45,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:45,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:45,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:45,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:45,612 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:26:45,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:45,622 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:26:45,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:45,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:45,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:46,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:46,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 17:26:46,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:26:46,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:26:46,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:26:46,266 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 35 states. [2018-02-04 17:26:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:47,901 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-02-04 17:26:47,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:26:47,901 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-02-04 17:26:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:47,901 INFO L225 Difference]: With dead ends: 147 [2018-02-04 17:26:47,901 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 17:26:47,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=208, Invalid=4082, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:26:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 17:26:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-02-04 17:26:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 17:26:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-02-04 17:26:47,904 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 139 [2018-02-04 17:26:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:47,904 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-02-04 17:26:47,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:26:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-02-04 17:26:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-04 17:26:47,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:47,905 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:47,905 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash -674637706, now seen corresponding path program 25 times [2018-02-04 17:26:47,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:47,905 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:47,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:47,905 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:47,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:47,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:47,993 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:47,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:47,993 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:47,993 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:48,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:48,169 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:26:48,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:48,186 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:26:48,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:48,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:48,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:48,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:48,203 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:26:48,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:48,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:48,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:48,231 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:26:48,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:48,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:48,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:26:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:48,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:48,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 17:26:48,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:26:48,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:26:48,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:26:48,903 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 37 states. [2018-02-04 17:26:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:50,584 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-02-04 17:26:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:26:50,584 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 144 [2018-02-04 17:26:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:50,584 INFO L225 Difference]: With dead ends: 152 [2018-02-04 17:26:50,584 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 17:26:50,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=223, Invalid=4607, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 17:26:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 17:26:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-02-04 17:26:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 17:26:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-02-04 17:26:50,586 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 144 [2018-02-04 17:26:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:50,587 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-02-04 17:26:50,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:26:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-02-04 17:26:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 17:26:50,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:50,587 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:50,587 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash -41598600, now seen corresponding path program 26 times [2018-02-04 17:26:50,587 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:50,587 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:50,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:50,591 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:26:50,591 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:50,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:50,704 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:50,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:50,704 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:50,705 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:26:51,048 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:26:51,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:51,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:51,082 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:26:51,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:51,087 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:26:51,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:51,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:51,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:51,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:51,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:51,105 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:26:51,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:51,113 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:26:51,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:51,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:51,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:51,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:51,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 17:26:51,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:26:51,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:26:51,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:26:51,705 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 37 states. [2018-02-04 17:26:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:54,289 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-02-04 17:26:54,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:26:54,289 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2018-02-04 17:26:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:54,290 INFO L225 Difference]: With dead ends: 157 [2018-02-04 17:26:54,290 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 17:26:54,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=220, Invalid=4610, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 17:26:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 17:26:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-02-04 17:26:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 17:26:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-02-04 17:26:54,293 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 149 [2018-02-04 17:26:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:54,293 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-02-04 17:26:54,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:26:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-02-04 17:26:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 17:26:54,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:54,294 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:54,295 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1693264310, now seen corresponding path program 27 times [2018-02-04 17:26:54,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:54,295 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:54,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:54,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:54,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:54,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:54,331 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:54,331 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:54,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:54,331 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:26:54,634 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 17:26:54,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:54,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:54,651 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:26:54,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:54,656 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:26:54,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:54,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:54,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:54,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:54,670 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:26:54,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:54,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:54,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:54,676 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:26:54,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:54,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:54,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:26:55,174 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 5 treesize of output 1 [2018-02-04 17:26:55,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:55,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:55,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-02-04 17:26:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:55,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:55,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 17:26:55,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:26:55,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:26:55,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:26:55,355 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 39 states. [2018-02-04 17:26:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:26:57,198 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-02-04 17:26:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:26:57,198 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-02-04 17:26:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:26:57,199 INFO L225 Difference]: With dead ends: 162 [2018-02-04 17:26:57,199 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 17:26:57,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=235, Invalid=5167, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:26:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 17:26:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-02-04 17:26:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 17:26:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-02-04 17:26:57,202 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 154 [2018-02-04 17:26:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:26:57,202 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-02-04 17:26:57,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:26:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-02-04 17:26:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 17:26:57,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:26:57,203 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:26:57,203 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:26:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash -738019272, now seen corresponding path program 28 times [2018-02-04 17:26:57,203 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:26:57,203 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:26:57,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:57,204 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:26:57,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:26:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:26:57,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:26:57,307 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:26:57,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:26:57,308 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:26:57,308 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:26:57,580 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:26:57,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:26:57,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:26:57,632 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:26:57,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:57,638 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:26:57,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:57,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:57,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:26:57,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:57,657 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:26:57,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:57,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:57,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:26:57,666 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:26:57,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:26:57,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:26:57,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:26:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:26:58,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:26:58,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 17:26:58,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:26:58,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:26:58,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:26:58,349 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 39 states. [2018-02-04 17:27:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:00,368 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-02-04 17:27:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:27:00,368 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 159 [2018-02-04 17:27:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:00,369 INFO L225 Difference]: With dead ends: 167 [2018-02-04 17:27:00,369 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 17:27:00,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=5170, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:27:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 17:27:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-04 17:27:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 17:27:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-02-04 17:27:00,371 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 159 [2018-02-04 17:27:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:00,371 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-02-04 17:27:00,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:27:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-02-04 17:27:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 17:27:00,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:00,372 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:00,372 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:00,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1207178506, now seen corresponding path program 29 times [2018-02-04 17:27:00,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:00,372 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:00,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:00,373 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:00,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:00,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:00,578 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:00,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:00,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:00,579 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:27:00,809 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 17:27:00,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:00,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:00,829 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:27:00,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:00,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:00,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:27:00,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:27:00,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:27:00,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:00,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:27:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:01,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:01,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 17:27:01,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:27:01,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:27:01,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:27:01,558 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 39 states. [2018-02-04 17:27:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:03,527 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-02-04 17:27:03,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:27:03,528 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 164 [2018-02-04 17:27:03,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:03,528 INFO L225 Difference]: With dead ends: 172 [2018-02-04 17:27:03,528 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 17:27:03,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=5173, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:27:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 17:27:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-02-04 17:27:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 17:27:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-02-04 17:27:03,531 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 164 [2018-02-04 17:27:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:03,531 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-02-04 17:27:03,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:27:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-02-04 17:27:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 17:27:03,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:03,532 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:03,532 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:03,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2010464520, now seen corresponding path program 30 times [2018-02-04 17:27:03,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:03,533 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:03,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:03,533 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:03,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:03,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:03,693 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:03,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:03,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:03,694 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:27:04,034 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 17:27:04,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:04,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:04,119 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:27:04,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:04,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:04,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:27:04,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:27:04,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:27:04,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:04,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:27:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:04,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:04,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 17:27:04,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:27:04,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:27:04,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:27:04,868 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 41 states. [2018-02-04 17:27:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:06,953 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-02-04 17:27:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:27:06,953 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 169 [2018-02-04 17:27:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:06,953 INFO L225 Difference]: With dead ends: 177 [2018-02-04 17:27:06,954 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 17:27:06,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=5762, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 17:27:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 17:27:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-02-04 17:27:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 17:27:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-02-04 17:27:06,956 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 169 [2018-02-04 17:27:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:06,956 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-02-04 17:27:06,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:27:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-02-04 17:27:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-02-04 17:27:06,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:06,957 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:06,957 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash -509993930, now seen corresponding path program 31 times [2018-02-04 17:27:06,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:06,957 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:06,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:06,957 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:06,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:06,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:07,110 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:07,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:07,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:07,111 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:27:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:07,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:07,381 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:27:07,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:07,391 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:27:07,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:07,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:07,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:27:07,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:07,408 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:27:07,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:07,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:07,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:07,416 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:27:07,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:07,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:07,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:27:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:08,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:08,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 17:27:08,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 17:27:08,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 17:27:08,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:27:08,214 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 43 states. [2018-02-04 17:27:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:10,547 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-02-04 17:27:10,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 17:27:10,547 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 174 [2018-02-04 17:27:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:10,548 INFO L225 Difference]: With dead ends: 182 [2018-02-04 17:27:10,548 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 17:27:10,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=259, Invalid=6383, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 17:27:10,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 17:27:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-02-04 17:27:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 17:27:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-02-04 17:27:10,550 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 174 [2018-02-04 17:27:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:10,550 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-02-04 17:27:10,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 17:27:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-02-04 17:27:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-04 17:27:10,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:10,550 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:10,550 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash 839472568, now seen corresponding path program 32 times [2018-02-04 17:27:10,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:10,551 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:10,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:10,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:27:10,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:10,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:10,705 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:10,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:10,705 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:10,705 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:27:10,908 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:27:10,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:10,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:10,936 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:27:10,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:10,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:10,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:27:10,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:27:10,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:27:10,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:10,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:27:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:11,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:11,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 17:27:11,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:27:11,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:27:11,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1804, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:27:11,819 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 44 states. [2018-02-04 17:27:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:14,108 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-02-04 17:27:14,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 17:27:14,108 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 179 [2018-02-04 17:27:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:14,108 INFO L225 Difference]: With dead ends: 187 [2018-02-04 17:27:14,108 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 17:27:14,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=268, Invalid=6704, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 17:27:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 17:27:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-02-04 17:27:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 17:27:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-02-04 17:27:14,110 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 179 [2018-02-04 17:27:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:14,111 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-02-04 17:27:14,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:27:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-02-04 17:27:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 17:27:14,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:14,111 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:14,111 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:14,111 INFO L82 PathProgramCache]: Analyzing trace with hash -250888842, now seen corresponding path program 33 times [2018-02-04 17:27:14,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:14,111 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:14,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:14,112 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:14,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:14,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:14,419 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:14,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:14,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:14,420 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:27:14,823 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 17:27:14,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:14,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:14,871 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:27:14,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:14,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:27:14,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:14,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:14,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:27:14,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:14,899 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:27:14,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:14,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:14,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:14,907 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:27:14,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:14,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:14,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:27:15,654 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 5 treesize of output 1 [2018-02-04 17:27:15,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:15,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:15,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-02-04 17:27:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:15,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:15,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 17:27:15,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 17:27:15,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 17:27:15,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1890, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:27:15,935 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 45 states. [2018-02-04 17:27:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:18,495 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-02-04 17:27:18,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 17:27:18,495 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 184 [2018-02-04 17:27:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:18,496 INFO L225 Difference]: With dead ends: 192 [2018-02-04 17:27:18,496 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 17:27:18,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=274, Invalid=7036, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 17:27:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 17:27:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-02-04 17:27:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 17:27:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-02-04 17:27:18,497 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 184 [2018-02-04 17:27:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:18,498 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-02-04 17:27:18,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 17:27:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-02-04 17:27:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 17:27:18,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:18,498 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:18,498 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1252686968, now seen corresponding path program 34 times [2018-02-04 17:27:18,499 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:18,499 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:18,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:18,499 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:18,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:18,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:18,739 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:18,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:18,739 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:18,739 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:27:19,080 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:27:19,081 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:19,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:19,112 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:27:19,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:19,118 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:27:19,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:19,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:19,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:27:19,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:19,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:19,135 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:27:19,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:19,140 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:27:19,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:19,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:19,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:27:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:20,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:20,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 17:27:20,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 17:27:20,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 17:27:20,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 17:27:20,103 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 46 states. [2018-02-04 17:27:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:22,636 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-02-04 17:27:22,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:27:22,636 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 189 [2018-02-04 17:27:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:22,637 INFO L225 Difference]: With dead ends: 197 [2018-02-04 17:27:22,637 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 17:27:22,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=277, Invalid=7379, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 17:27:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 17:27:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-02-04 17:27:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 17:27:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-02-04 17:27:22,640 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 189 [2018-02-04 17:27:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:22,640 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-02-04 17:27:22,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 17:27:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-02-04 17:27:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-04 17:27:22,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:22,641 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:22,641 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash 886361782, now seen corresponding path program 35 times [2018-02-04 17:27:22,641 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:22,641 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:22,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:22,642 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:22,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:22,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:22,954 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:22,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:22,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:22,955 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:27:23,448 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 17:27:23,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:23,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:23,476 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:27:23,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:23,480 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:27:23,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:23,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:23,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:27:23,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:23,493 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:27:23,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:23,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:23,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:23,500 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:27:23,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:23,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:23,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:27:23,711 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 5 treesize of output 1 [2018-02-04 17:27:23,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:23,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:23,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-02-04 17:27:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:24,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:24,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 17:27:24,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 17:27:24,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 17:27:24,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 17:27:24,411 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 46 states. [2018-02-04 17:27:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:27,121 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-02-04 17:27:27,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:27:27,121 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 194 [2018-02-04 17:27:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:27,122 INFO L225 Difference]: With dead ends: 202 [2018-02-04 17:27:27,122 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 17:27:27,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=274, Invalid=7382, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 17:27:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 17:27:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-02-04 17:27:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 17:27:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-02-04 17:27:27,123 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 194 [2018-02-04 17:27:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:27,124 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-02-04 17:27:27,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 17:27:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-02-04 17:27:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-04 17:27:27,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:27,124 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:27,124 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:27,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1813656376, now seen corresponding path program 36 times [2018-02-04 17:27:27,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:27,125 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:27,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:27,125 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:27,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:27,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:27,310 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:27,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:27,311 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:27,311 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:27:27,769 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 17:27:27,769 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:27,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:27,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:27:27,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:27,798 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:27:27,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:27,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:27,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:27:27,811 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:27,812 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:27:27,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:27,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:27,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:27,819 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:27:27,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:27,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:27,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:27:28,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:27:28,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:28,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:28,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-02-04 17:27:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:28,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:28,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 17:27:28,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:27:28,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:27:28,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2348, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:27:28,941 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 50 states. [2018-02-04 17:27:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:31,899 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-02-04 17:27:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:27:31,899 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 199 [2018-02-04 17:27:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:31,900 INFO L225 Difference]: With dead ends: 207 [2018-02-04 17:27:31,900 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 17:27:31,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=304, Invalid=8626, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 17:27:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 17:27:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-02-04 17:27:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 17:27:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-02-04 17:27:31,902 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 199 [2018-02-04 17:27:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:31,902 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-02-04 17:27:31,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:27:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-02-04 17:27:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-02-04 17:27:31,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:31,903 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:31,903 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:31,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2053722102, now seen corresponding path program 37 times [2018-02-04 17:27:31,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:31,904 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:31,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:31,904 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:31,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:31,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:32,175 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:32,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:32,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:32,176 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:27:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:32,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:32,714 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:27:32,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:32,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:32,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:27:32,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:27:32,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:27:32,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:32,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:27:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:33,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:33,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 17:27:33,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:27:33,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:27:33,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:27:33,725 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 49 states. [2018-02-04 17:27:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:36,446 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-02-04 17:27:36,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:27:36,446 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 204 [2018-02-04 17:27:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:36,447 INFO L225 Difference]: With dead ends: 212 [2018-02-04 17:27:36,447 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 17:27:36,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=295, Invalid=8447, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 17:27:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 17:27:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-02-04 17:27:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 17:27:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-02-04 17:27:36,449 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 204 [2018-02-04 17:27:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:36,449 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-02-04 17:27:36,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:27:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-02-04 17:27:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 17:27:36,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:36,450 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:36,450 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:36,450 INFO L82 PathProgramCache]: Analyzing trace with hash 291797496, now seen corresponding path program 38 times [2018-02-04 17:27:36,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:36,450 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:36,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:36,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:27:36,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:36,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:36,752 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:36,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:36,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:36,752 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:27:37,187 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:27:37,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:37,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:37,221 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:27:37,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:37,225 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:27:37,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:37,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:37,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:27:37,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:37,238 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:27:37,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:37,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:37,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27: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, 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:27:37,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:37,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:37,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:27:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:38,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:38,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 17:27:38,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:27:38,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:27:38,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:27:38,263 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 50 states. [2018-02-04 17:27:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:41,510 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-02-04 17:27:41,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:27:41,511 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 209 [2018-02-04 17:27:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:41,511 INFO L225 Difference]: With dead ends: 217 [2018-02-04 17:27:41,511 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 17:27:41,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=301, Invalid=8819, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 17:27:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 17:27:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-02-04 17:27:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 17:27:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-02-04 17:27:41,513 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 209 [2018-02-04 17:27:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:41,513 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-02-04 17:27:41,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:27:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-02-04 17:27:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-04 17:27:41,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:41,514 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:41,514 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:41,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1312637238, now seen corresponding path program 39 times [2018-02-04 17:27:41,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:41,514 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:41,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:41,516 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:41,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:41,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:41,859 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:41,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:41,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:41,859 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:27:42,320 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 17:27:42,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:42,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:42,343 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:27:42,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:42,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:42,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:27:42,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:27:42,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:27:42,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:42,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:27:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:43,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:43,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 17:27:43,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:27:43,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:27:43,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:27:43,304 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 50 states. [2018-02-04 17:27:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:46,252 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-02-04 17:27:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:27:46,253 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 214 [2018-02-04 17:27:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:46,253 INFO L225 Difference]: With dead ends: 222 [2018-02-04 17:27:46,253 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 17:27:46,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=298, Invalid=8822, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 17:27:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 17:27:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-02-04 17:27:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 17:27:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-02-04 17:27:46,256 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 214 [2018-02-04 17:27:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:46,256 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-02-04 17:27:46,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:27:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-02-04 17:27:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-02-04 17:27:46,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:46,257 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:46,257 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:46,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1452626104, now seen corresponding path program 40 times [2018-02-04 17:27:46,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:46,257 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:46,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:46,257 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:46,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:46,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:46,352 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:46,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:46,353 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:46,353 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:27:46,729 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:27:46,730 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:46,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:46,781 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:27:46,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:46,785 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:27:46,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:46,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:46,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:27:46,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:46,798 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:27:46,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:46,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:46,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:46,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 11 treesize of output 4 [2018-02-04 17:27:46,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:46,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:46,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:27:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:47,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:47,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 17:27:47,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 17:27:47,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 17:27:47,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:27:47,968 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 52 states. [2018-02-04 17:27:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:51,367 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-02-04 17:27:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:27:51,367 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 219 [2018-02-04 17:27:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:51,368 INFO L225 Difference]: With dead ends: 227 [2018-02-04 17:27:51,368 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 17:27:51,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=313, Invalid=9587, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 17:27:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 17:27:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-02-04 17:27:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 17:27:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-02-04 17:27:51,370 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 219 [2018-02-04 17:27:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:51,370 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-02-04 17:27:51,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 17:27:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-02-04 17:27:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-02-04 17:27:51,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:51,371 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:51,371 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1002742390, now seen corresponding path program 41 times [2018-02-04 17:27:51,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:51,371 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:51,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:51,372 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:51,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:51,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:51,581 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:51,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:51,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:51,582 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:27:51,994 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 17:27:51,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:52,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:52,012 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:27:52,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:52,017 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:27:52,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:52,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:52,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:27:52,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:52,031 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:27:52,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:52,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:52,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:27:52,039 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:27:52,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:52,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:52,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:27:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:53,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:53,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 17:27:53,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 17:27:53,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 17:27:53,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:27:53,158 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 52 states. [2018-02-04 17:27:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:27:56,578 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-02-04 17:27:56,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:27:56,578 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 224 [2018-02-04 17:27:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:27:56,579 INFO L225 Difference]: With dead ends: 232 [2018-02-04 17:27:56,579 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 17:27:56,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=310, Invalid=9590, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 17:27:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 17:27:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-02-04 17:27:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-04 17:27:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-02-04 17:27:56,581 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 224 [2018-02-04 17:27:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:27:56,581 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-02-04 17:27:56,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 17:27:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-02-04 17:27:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-02-04 17:27:56,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:27:56,582 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:27:56,582 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:27:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1195853960, now seen corresponding path program 42 times [2018-02-04 17:27:56,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:27:56,582 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:27:56,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:56,583 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:27:56,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:27:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:27:56,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:27:56,989 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:27:56,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:27:56,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:27:56,990 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:27:57,637 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 17:27:57,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:27:57,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:27:57,675 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:27:57,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:27:57,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:57,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:27:57,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:27:57,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:27:57,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:27:57,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:27:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:27:58,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:27:58,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 17:27:58,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:27:58,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:27:58,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:27:58,758 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 53 states. [2018-02-04 17:28:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:28:02,252 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-02-04 17:28:02,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 17:28:02,253 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 229 [2018-02-04 17:28:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:28:02,253 INFO L225 Difference]: With dead ends: 237 [2018-02-04 17:28:02,253 INFO L226 Difference]: Without dead ends: 237 [2018-02-04 17:28:02,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=316, Invalid=9986, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 17:28:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-04 17:28:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-02-04 17:28:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-04 17:28:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-02-04 17:28:02,256 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 229 [2018-02-04 17:28:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:28:02,256 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-02-04 17:28:02,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:28:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-02-04 17:28:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-02-04 17:28:02,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:28:02,257 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:28:02,257 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:28:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash 225670070, now seen corresponding path program 43 times [2018-02-04 17:28:02,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:28:02,257 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:28:02,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:02,258 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:28:02,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:02,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:28:02,811 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:28:02,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:28:02,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:28:02,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:28:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:03,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:28:03,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 6 treesize of output 5 [2018-02-04 17:28:03,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:03,376 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:28:03,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:03,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:03,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:28:03,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:03,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:03,389 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:28:03,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:03,393 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:28:03,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:03,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:03,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:28:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:28:04,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:28:04,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 17:28:04,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 17:28:04,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 17:28:04,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:28:04,670 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 55 states. [2018-02-04 17:28:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:28:08,470 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-02-04 17:28:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 17:28:08,470 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 234 [2018-02-04 17:28:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:28:08,471 INFO L225 Difference]: With dead ends: 242 [2018-02-04 17:28:08,471 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 17:28:08,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=331, Invalid=10799, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 17:28:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 17:28:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-02-04 17:28:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-04 17:28:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-02-04 17:28:08,473 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 234 [2018-02-04 17:28:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:28:08,474 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-02-04 17:28:08,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 17:28:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-02-04 17:28:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-02-04 17:28:08,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:28:08,474 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:28:08,474 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:28:08,475 INFO L82 PathProgramCache]: Analyzing trace with hash -707088840, now seen corresponding path program 44 times [2018-02-04 17:28:08,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:28:08,475 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:28:08,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:08,475 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:28:08,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:08,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:28:08,933 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:28:08,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:28:08,933 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:28:08,933 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:28:09,658 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:28:09,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:28:09,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:28:09,778 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:28:09,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:09,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:09,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:28:09,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:28:09,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:28:09,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:09,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:28:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:28:10,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:28:10,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 17:28:10,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 17:28:10,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 17:28:10,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:28:10,980 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 56 states. [2018-02-04 17:28:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:28:14,629 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-02-04 17:28:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:28:14,629 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 239 [2018-02-04 17:28:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:28:14,630 INFO L225 Difference]: With dead ends: 247 [2018-02-04 17:28:14,630 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 17:28:14,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=337, Invalid=11219, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 17:28:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 17:28:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-02-04 17:28:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 17:28:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-02-04 17:28:14,633 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 239 [2018-02-04 17:28:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:28:14,633 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-02-04 17:28:14,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 17:28:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-02-04 17:28:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-02-04 17:28:14,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:28:14,634 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:28:14,634 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:28:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash 213759222, now seen corresponding path program 45 times [2018-02-04 17:28:14,635 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:28:14,635 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:28:14,635 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:14,635 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:28:14,635 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:14,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:28:14,992 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:28:14,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:28:14,993 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:28:14,993 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:28:15,674 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 17:28:15,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:28:15,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:28:15,710 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:28:15,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:15,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:15,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:28:15,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:28:15,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:28:15,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:15,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:28:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:28:16,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:28:16,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 17:28:16,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 17:28:16,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 17:28:16,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3189, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:28:16,955 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 58 states. [2018-02-04 17:28:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:28:20,801 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-02-04 17:28:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:28:20,801 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 244 [2018-02-04 17:28:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:28:20,802 INFO L225 Difference]: With dead ends: 252 [2018-02-04 17:28:20,802 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 17:28:20,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=355, Invalid=12077, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 17:28:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 17:28:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-02-04 17:28:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-04 17:28:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-02-04 17:28:20,804 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 244 [2018-02-04 17:28:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:28:20,804 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-02-04 17:28:20,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 17:28:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-02-04 17:28:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 17:28:20,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:28:20,805 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:28:20,805 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:28:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash 755447032, now seen corresponding path program 46 times [2018-02-04 17:28:20,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:28:20,806 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:28:20,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:20,806 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:28:20,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:20,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:28:21,305 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:28:21,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:28:21,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:28:21,306 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:28:21,849 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:28:21,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:28:21,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:28:21,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:28:21,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:21,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:28:21,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:21,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:21,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:28:21,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:21,931 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:28:21,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:21,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:21,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:21,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:28:21,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:21,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:21,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:28:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:28:23,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:28:23,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 17:28:23,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 17:28:23,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 17:28:23,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:28:23,328 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 58 states. [2018-02-04 17:28:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:28:27,435 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-02-04 17:28:27,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:28:27,435 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 249 [2018-02-04 17:28:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:28:27,436 INFO L225 Difference]: With dead ends: 257 [2018-02-04 17:28:27,436 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 17:28:27,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=349, Invalid=12083, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 17:28:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 17:28:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-02-04 17:28:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-04 17:28:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-02-04 17:28:27,438 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 249 [2018-02-04 17:28:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:28:27,438 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-02-04 17:28:27,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 17:28:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-02-04 17:28:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-02-04 17:28:27,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:28:27,440 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:28:27,440 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:28:27,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1108829750, now seen corresponding path program 47 times [2018-02-04 17:28:27,440 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:28:27,440 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:28:27,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:27,441 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:28:27,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:27,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:28:27,779 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:28:27,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:28:27,779 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:28:27,780 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:28:28,565 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 17:28:28,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:28:28,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:28:28,594 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:28:28,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:28,598 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:28:28,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:28,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:28,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:28:28,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:28,612 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:28:28,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:28,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:28,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:28,619 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:28:28,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:28,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:28,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:28:28,748 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 5 treesize of output 1 [2018-02-04 17:28:28,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:28,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:28,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-02-04 17:28:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:28:29,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:28:29,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 17:28:29,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 17:28:29,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 17:28:29,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:28:29,910 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 57 states. [2018-02-04 17:28:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:28:34,155 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-02-04 17:28:34,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 17:28:34,155 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 254 [2018-02-04 17:28:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:28:34,156 INFO L225 Difference]: With dead ends: 262 [2018-02-04 17:28:34,156 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 17:28:34,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=337, Invalid=11653, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 17:28:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 17:28:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-02-04 17:28:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 17:28:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-02-04 17:28:34,159 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 254 [2018-02-04 17:28:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:28:34,159 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-02-04 17:28:34,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 17:28:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-02-04 17:28:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-02-04 17:28:34,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:28:34,161 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:28:34,161 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:28:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash -565556296, now seen corresponding path program 48 times [2018-02-04 17:28:34,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:28:34,161 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:28:34,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:34,162 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:28:34,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:34,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:28:34,423 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:28:34,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:28:34,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:28:34,424 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:28:35,822 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 17:28:35,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:28:35,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:28:35,885 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:28:35,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:35,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:35,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:28:35,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:28:35,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:28:35,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:35,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:28:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:28:37,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:28:37,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 17:28:37,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 17:28:37,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 17:28:37,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:28:37,265 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 59 states. [2018-02-04 17:28:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:28:41,561 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-02-04 17:28:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 17:28:41,561 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 259 [2018-02-04 17:28:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:28:41,562 INFO L225 Difference]: With dead ends: 267 [2018-02-04 17:28:41,562 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 17:28:41,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=352, Invalid=12530, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 17:28:41,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 17:28:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-02-04 17:28:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 17:28:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-02-04 17:28:41,566 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 259 [2018-02-04 17:28:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:28:41,566 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-02-04 17:28:41,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 17:28:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-02-04 17:28:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-02-04 17:28:41,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:28:41,568 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:28:41,568 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:28:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1259042954, now seen corresponding path program 49 times [2018-02-04 17:28:41,568 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:28:41,568 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:28:41,569 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:41,569 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:28:41,569 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:41,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:28:41,943 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:28:41,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:28:41,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:28:41,995 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:28:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:42,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:28:42,361 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:28:42,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:42,365 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:28:42,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:42,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:42,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:28:42,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:42,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:42,378 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:28:42,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:42,382 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:28:42,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:42,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:42,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:28:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:28:43,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:28:43,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 17:28:43,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:28:43,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:28:43,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:28:43,893 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 61 states. [2018-02-04 17:28:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:28:48,420 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-02-04 17:28:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 17:28:48,420 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 264 [2018-02-04 17:28:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:28:48,421 INFO L225 Difference]: With dead ends: 272 [2018-02-04 17:28:48,421 INFO L226 Difference]: Without dead ends: 272 [2018-02-04 17:28:48,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=367, Invalid=13439, Unknown=0, NotChecked=0, Total=13806 [2018-02-04 17:28:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-04 17:28:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-02-04 17:28:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 17:28:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-02-04 17:28:48,423 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 264 [2018-02-04 17:28:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:28:48,424 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-02-04 17:28:48,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:28:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-02-04 17:28:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-02-04 17:28:48,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:28:48,424 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:28:48,424 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:28:48,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1789915768, now seen corresponding path program 50 times [2018-02-04 17:28:48,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:28:48,425 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:28:48,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:48,425 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:28:48,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:48,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:28:48,897 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:28:48,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:28:48,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:28:48,897 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:28:50,519 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:28:50,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:28:50,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:28:50,554 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:28:50,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:50,558 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:28:50,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:50,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:50,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:28:50,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:50,570 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:28:50,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:50,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:50,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:50,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:28:50,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:50,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:50,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:28:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:28:52,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:28:52,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 17:28:52,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:28:52,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:28:52,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:28:52,165 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 61 states. [2018-02-04 17:28:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:28:57,124 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-02-04 17:28:57,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 17:28:57,125 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 269 [2018-02-04 17:28:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:28:57,125 INFO L225 Difference]: With dead ends: 277 [2018-02-04 17:28:57,125 INFO L226 Difference]: Without dead ends: 277 [2018-02-04 17:28:57,126 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=364, Invalid=13442, Unknown=0, NotChecked=0, Total=13806 [2018-02-04 17:28:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-04 17:28:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-02-04 17:28:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-04 17:28:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-02-04 17:28:57,127 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 269 [2018-02-04 17:28:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:28:57,128 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-02-04 17:28:57,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:28:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-02-04 17:28:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-02-04 17:28:57,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:28:57,128 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:28:57,129 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 17:28:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1412884298, now seen corresponding path program 51 times [2018-02-04 17:28:57,129 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:28:57,129 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:28:57,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:57,129 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:28:57,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:28:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:28:57,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:28:57,220 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:28:57,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:28:57,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:28:57,220 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:28:58,206 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 17:28:58,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:28:58,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:28:58,243 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:28:58,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:58,255 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:28:58,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:58,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:58,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:28:58,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:58,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:28:58,271 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:28:58,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:58,276 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:28:58,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:58,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:58,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:28:59,614 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 5 treesize of output 1 [2018-02-04 17:28:59,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:28:59,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:28:59,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-02-04 17:28:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:28:59,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:28:59,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 17:28:59,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 17:28:59,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 17:28:59,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3781, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:28:59,963 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 63 states. Received shutdown request... [2018-02-04 17:29:04,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 17:29:04,978 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:29:04,982 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:29:04,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:29:04 BoogieIcfgContainer [2018-02-04 17:29:04,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:29:04,983 INFO L168 Benchmark]: Toolchain (without parser) took 176146.82 ms. Allocated memory was 397.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 356.1 MB in the beginning and 483.8 MB in the end (delta: -127.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-02-04 17:29:04,983 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:29:04,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.46 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 345.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:29:04,984 INFO L168 Benchmark]: Boogie Preprocessor took 21.53 ms. Allocated memory is still 397.9 MB. Free memory was 345.5 MB in the beginning and 342.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:29:04,984 INFO L168 Benchmark]: RCFGBuilder took 162.23 ms. Allocated memory is still 397.9 MB. Free memory was 342.9 MB in the beginning and 326.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:29:04,984 INFO L168 Benchmark]: TraceAbstraction took 175814.03 ms. Allocated memory was 397.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 326.2 MB in the beginning and 483.8 MB in the end (delta: -157.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-02-04 17:29:04,985 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.16 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.46 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 345.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.53 ms. Allocated memory is still 397.9 MB. Free memory was 345.5 MB in the beginning and 342.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 162.23 ms. Allocated memory is still 397.9 MB. Free memory was 342.9 MB in the beginning and 326.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 175814.03 ms. Allocated memory was 397.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 326.2 MB in the beginning and 483.8 MB in the end (delta: -157.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 59 states, 63 states before enhancement), while ReachableStatesComputation was computing reachable states (264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 59 states, 63 states before enhancement), while ReachableStatesComputation was computing reachable states (264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 59 states, 63 states before enhancement), while ReachableStatesComputation was computing reachable states (264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 59 states, 63 states before enhancement), while ReachableStatesComputation was computing reachable states (264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 59 states, 63 states before enhancement), while ReachableStatesComputation was computing reachable states (264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 59 states, 63 states before enhancement), while ReachableStatesComputation was computing reachable states (264 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 59 states, 63 states before enhancement), while ReachableStatesComputation was computing reachable states (264 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. TIMEOUT Result, 175.7s OverallTime, 66 OverallIterations, 52 TraceHistogramMax, 107.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3659 SDtfs, 7334 SDslu, 127536 SDs, 0 SdLazy, 185745 SolverSat, 1685 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9609 GetRequests, 5887 SyntacticMatches, 7 SemanticMatches, 3715 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36630 ImplicationChecksByTransitivity, 77.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=65, 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.1s AutomataMinimizationTime, 65 MinimizatonAttempts, 209 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 17.6s SatisfiabilityAnalysisTime, 50.2s InterpolantComputationTime, 15797 NumberOfCodeBlocks, 15788 NumberOfCodeBlocksAsserted, 811 NumberOfCheckSat, 7903 ConstructedInterpolants, 94 QuantifiedInterpolants, 22778936 SizeOfPredicates, 682 NumberOfNonLiveVariables, 33547 ConjunctsInSsa, 10199 ConjunctsInUnsatCore, 67 InterpolantComputations, 10 PerfectInterpolantSequences, 32/114612 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-29-04-989.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-29-04-989.csv Completed graceful shutdown