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/memsafety/lockfree-3.0_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:56:23,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:56:23,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:56:23,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:56:23,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:56:23,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:56:23,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:56:23,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:56:23,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:56:23,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:56:23,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:56:23,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:56:23,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:56:23,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:56:23,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:56:23,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:56:23,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:56:23,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:56:23,092 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:56:23,093 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:56:23,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:56:23,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:56:23,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:56:23,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:56:23,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:56:23,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:56:23,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:56:23,099 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:56:23,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:56:23,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:56:23,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:56:23,100 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:56:23,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:56:23,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:56:23,110 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:56:23,110 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:56:23,110 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:56:23,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:56:23,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:56:23,111 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:56:23,111 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:56:23,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:56:23,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:56:23,112 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:56:23,112 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:56:23,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:56:23,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:56:23,112 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:56:23,112 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:56:23,113 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:56:23,113 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:56:23,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:56:23,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:56:23,113 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:56:23,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:56:23,114 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:56:23,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:56:23,162 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:56:23,165 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:56:23,167 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:56:23,167 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:56:23,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i [2018-02-04 17:56:23,310 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:56:23,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:56:23,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:56:23,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:56:23,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:56:23,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:56:23" (1/1) ... [2018-02-04 17:56:23,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23, skipping insertion in model container [2018-02-04 17:56:23,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:56:23" (1/1) ... [2018-02-04 17:56:23,334 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:56:23,362 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:56:23,458 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:56:23,471 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:56:23,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23 WrapperNode [2018-02-04 17:56:23,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:56:23,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:56:23,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:56:23,476 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:56:23,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23" (1/1) ... [2018-02-04 17:56:23,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23" (1/1) ... [2018-02-04 17:56:23,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23" (1/1) ... [2018-02-04 17:56:23,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23" (1/1) ... [2018-02-04 17:56:23,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23" (1/1) ... [2018-02-04 17:56:23,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23" (1/1) ... [2018-02-04 17:56:23,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23" (1/1) ... [2018-02-04 17:56:23,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:56:23,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:56:23,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:56:23,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:56:23,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23" (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:56:23,539 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:56:23,539 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:56:23,540 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 17:56:23,540 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 17:56:23,540 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:56:23,540 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 17:56:23,540 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 17:56:23,540 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:56:23,540 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:56:23,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:56:23,542 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:56:23,787 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:56:23,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:56:23 BoogieIcfgContainer [2018-02-04 17:56:23,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:56:23,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:56:23,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:56:23,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:56:23,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:56:23" (1/3) ... [2018-02-04 17:56:23,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70687db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:56:23, skipping insertion in model container [2018-02-04 17:56:23,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:56:23" (2/3) ... [2018-02-04 17:56:23,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70687db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:56:23, skipping insertion in model container [2018-02-04 17:56:23,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:56:23" (3/3) ... [2018-02-04 17:56:23,795 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-02-04 17:56:23,800 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:56:23,806 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 17:56:23,830 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:56:23,831 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:56:23,831 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:56:23,831 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:56:23,831 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:56:23,831 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:56:23,831 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:56:23,831 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:56:23,832 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:56:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 17:56:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 17:56:23,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:23,850 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:23,850 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 17:56:23,854 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:23,854 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:23,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:23,886 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:23,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:23,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:23,966 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:56:23,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:23,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:56:23,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 17:56:23,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 17:56:23,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 17:56:23,983 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 17:56:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:24,072 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 17:56:24,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 17:56:24,073 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 17:56:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:24,084 INFO L225 Difference]: With dead ends: 76 [2018-02-04 17:56:24,084 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:56:24,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 17:56:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:56:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 17:56:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 17:56:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 17:56:24,114 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 17:56:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:24,114 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 17:56:24,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 17:56:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 17:56:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 17:56:24,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:24,115 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:24,115 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 17:56:24,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:24,116 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:24,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,116 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:24,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:24,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:24,163 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:56:24,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:24,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:56:24,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:56:24,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:56:24,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:56:24,165 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 17:56:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:24,183 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 17:56:24,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:56:24,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 17:56:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:24,187 INFO L225 Difference]: With dead ends: 74 [2018-02-04 17:56:24,187 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 17:56:24,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:56:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 17:56:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 17:56:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 17:56:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 17:56:24,194 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 17:56:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:24,194 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 17:56:24,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:56:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 17:56:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 17:56:24,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:24,195 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:24,195 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:24,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 17:56:24,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:24,195 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:24,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:24,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:24,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:24,263 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:56:24,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:24,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:56:24,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:56:24,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:56:24,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:56:24,265 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 17:56:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:24,312 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 17:56:24,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:56:24,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 17:56:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:24,313 INFO L225 Difference]: With dead ends: 132 [2018-02-04 17:56:24,313 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 17:56:24,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:56:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 17:56:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 17:56:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 17:56:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 17:56:24,324 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 17:56:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:24,324 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 17:56:24,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:56:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 17:56:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:56:24,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:24,324 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:24,324 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 17:56:24,325 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:24,325 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:24,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,325 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:24,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:24,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:24,367 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:56:24,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:24,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:56:24,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:56:24,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:56:24,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:56:24,368 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 17:56:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:24,419 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 17:56:24,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:56:24,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 17:56:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:24,421 INFO L225 Difference]: With dead ends: 147 [2018-02-04 17:56:24,421 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 17:56:24,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:56:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 17:56:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 17:56:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 17:56:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 17:56:24,430 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 17:56:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:24,430 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 17:56:24,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:56:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 17:56:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:56:24,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:24,431 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:24,431 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 17:56:24,431 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:24,432 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:24,432 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,432 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:24,432 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:24,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:24,481 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:56:24,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:24,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:56:24,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:56:24,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:56:24,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:56:24,483 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 17:56:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:24,549 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 17:56:24,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:56:24,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 17:56:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:24,553 INFO L225 Difference]: With dead ends: 255 [2018-02-04 17:56:24,553 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 17:56:24,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:56:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 17:56:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 17:56:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 17:56:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 17:56:24,568 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 17:56:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:24,568 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 17:56:24,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:56:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 17:56:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:56:24,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:24,569 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:24,569 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:24,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 17:56:24,569 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:24,569 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:24,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,570 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:24,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:24,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:24,615 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:56:24,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:24,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:56:24,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:56:24,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:56:24,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:56:24,616 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 17:56:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:24,727 INFO L93 Difference]: Finished difference Result 388 states and 570 transitions. [2018-02-04 17:56:24,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:56:24,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:56:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:24,729 INFO L225 Difference]: With dead ends: 388 [2018-02-04 17:56:24,729 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 17:56:24,730 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:56:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 17:56:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-02-04 17:56:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 17:56:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 17:56:24,745 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 17:56:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:24,745 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 17:56:24,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:56:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 17:56:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:56:24,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:24,746 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:24,746 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 17:56:24,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:24,746 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:24,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,747 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:24,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:24,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:24,796 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:56:24,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:24,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:56:24,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:56:24,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:56:24,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:56:24,797 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 17:56:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:24,885 INFO L93 Difference]: Finished difference Result 487 states and 717 transitions. [2018-02-04 17:56:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:56:24,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:56:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:24,889 INFO L225 Difference]: With dead ends: 487 [2018-02-04 17:56:24,889 INFO L226 Difference]: Without dead ends: 487 [2018-02-04 17:56:24,889 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:56:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-02-04 17:56:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2018-02-04 17:56:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 17:56:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 17:56:24,904 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 17:56:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:24,904 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 17:56:24,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:56:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 17:56:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:56:24,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:24,905 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:24,905 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 17:56:24,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:24,905 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:24,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:24,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:24,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:24,943 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:56:24,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:24,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:56:24,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:56:24,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:56:24,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:56:24,944 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 17:56:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:24,987 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 17:56:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:56:24,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 17:56:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:24,993 INFO L225 Difference]: With dead ends: 861 [2018-02-04 17:56:24,993 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 17:56:24,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:56:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 17:56:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 17:56:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 17:56:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 17:56:25,019 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 17:56:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:25,019 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 17:56:25,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:56:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 17:56:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 17:56:25,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:25,020 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:25,020 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:25,020 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 17:56:25,021 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:25,021 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:25,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:25,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:25,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:25,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:25,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:25,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:25,080 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:25,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:25,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:25,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 17:56:25,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:56:25,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:56:25,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:56:25,174 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 17:56:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:25,249 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 17:56:25,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:56:25,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 17:56:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:25,254 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 17:56:25,254 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 17:56:25,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:56:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 17:56:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 17:56:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 17:56:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 17:56:25,287 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 17:56:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:25,287 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 17:56:25,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:56:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 17:56:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:56:25,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:25,288 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, 1, 1, 1] [2018-02-04 17:56:25,288 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:25,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 17:56:25,289 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:25,289 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:25,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:25,290 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:25,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:25,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:25,391 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:25,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:25,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:25,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:25,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:56:25,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-02-04 17:56:25,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:56:25,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:56:25,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:56:25,455 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 12 states. [2018-02-04 17:56:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:26,678 INFO L93 Difference]: Finished difference Result 5413 states and 8632 transitions. [2018-02-04 17:56:26,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 17:56:26,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-04 17:56:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:26,704 INFO L225 Difference]: With dead ends: 5413 [2018-02-04 17:56:26,704 INFO L226 Difference]: Without dead ends: 5413 [2018-02-04 17:56:26,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=648, Invalid=3012, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:56:26,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5413 states. [2018-02-04 17:56:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5413 to 4436. [2018-02-04 17:56:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4436 states. [2018-02-04 17:56:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 6634 transitions. [2018-02-04 17:56:26,843 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 6634 transitions. Word has length 27 [2018-02-04 17:56:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:26,843 INFO L432 AbstractCegarLoop]: Abstraction has 4436 states and 6634 transitions. [2018-02-04 17:56:26,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:56:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 6634 transitions. [2018-02-04 17:56:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:56:26,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:26,845 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:26,847 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:26,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-04 17:56:26,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:26,847 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:26,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:26,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:26,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:26,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:26,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:26,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:56:26,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:56:26,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:56:26,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:56:26,913 INFO L87 Difference]: Start difference. First operand 4436 states and 6634 transitions. Second operand 7 states. [2018-02-04 17:56:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:27,097 INFO L93 Difference]: Finished difference Result 2014 states and 2540 transitions. [2018-02-04 17:56:27,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:56:27,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 17:56:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:27,103 INFO L225 Difference]: With dead ends: 2014 [2018-02-04 17:56:27,103 INFO L226 Difference]: Without dead ends: 1582 [2018-02-04 17:56:27,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:56:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-02-04 17:56:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1447. [2018-02-04 17:56:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-02-04 17:56:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1933 transitions. [2018-02-04 17:56:27,135 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1933 transitions. Word has length 31 [2018-02-04 17:56:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:27,135 INFO L432 AbstractCegarLoop]: Abstraction has 1447 states and 1933 transitions. [2018-02-04 17:56:27,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:56:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1933 transitions. [2018-02-04 17:56:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 17:56:27,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:27,137 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:27,137 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-04 17:56:27,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:27,137 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:27,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:27,138 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:27,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:27,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:27,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:27,250 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:27,251 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:27,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:27,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:56:27,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-02-04 17:56:27,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:56:27,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:56:27,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:56:27,313 INFO L87 Difference]: Start difference. First operand 1447 states and 1933 transitions. Second operand 12 states. [2018-02-04 17:56:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:27,987 INFO L93 Difference]: Finished difference Result 2624 states and 3481 transitions. [2018-02-04 17:56:27,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:56:27,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 17:56:27,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:27,998 INFO L225 Difference]: With dead ends: 2624 [2018-02-04 17:56:27,998 INFO L226 Difference]: Without dead ends: 2612 [2018-02-04 17:56:27,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:56:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2018-02-04 17:56:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2012. [2018-02-04 17:56:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2018-02-04 17:56:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2686 transitions. [2018-02-04 17:56:28,056 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2686 transitions. Word has length 31 [2018-02-04 17:56:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:28,057 INFO L432 AbstractCegarLoop]: Abstraction has 2012 states and 2686 transitions. [2018-02-04 17:56:28,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:56:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2686 transitions. [2018-02-04 17:56:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:56:28,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:28,058 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:28,058 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:28,058 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-04 17:56:28,058 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:28,058 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:28,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:28,063 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:28,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:28,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:56:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:28,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:28,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:28,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:28,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 17:56:28,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:56:28,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-04 17:56:28,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:56:28,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:56:28,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:56:28,227 INFO L87 Difference]: Start difference. First operand 2012 states and 2686 transitions. Second operand 10 states. [2018-02-04 17:56:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:28,671 INFO L93 Difference]: Finished difference Result 2227 states and 2898 transitions. [2018-02-04 17:56:28,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:56:28,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 17:56:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:28,678 INFO L225 Difference]: With dead ends: 2227 [2018-02-04 17:56:28,679 INFO L226 Difference]: Without dead ends: 2227 [2018-02-04 17:56:28,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:56:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-02-04 17:56:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1960. [2018-02-04 17:56:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2018-02-04 17:56:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2578 transitions. [2018-02-04 17:56:28,716 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2578 transitions. Word has length 38 [2018-02-04 17:56:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:28,716 INFO L432 AbstractCegarLoop]: Abstraction has 1960 states and 2578 transitions. [2018-02-04 17:56:28,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:56:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2578 transitions. [2018-02-04 17:56:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 17:56:28,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:28,717 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:28,717 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:28,717 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-04 17:56:28,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:28,718 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:28,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:28,718 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:28,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:28,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 17:56:28,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:28,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:28,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:28,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:28,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:28,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-02-04 17:56:28,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:56:28,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:56:28,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:56:28,882 INFO L87 Difference]: Start difference. First operand 1960 states and 2578 transitions. Second operand 14 states. [2018-02-04 17:56:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:29,574 INFO L93 Difference]: Finished difference Result 4076 states and 5859 transitions. [2018-02-04 17:56:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:56:29,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-04 17:56:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:29,591 INFO L225 Difference]: With dead ends: 4076 [2018-02-04 17:56:29,591 INFO L226 Difference]: Without dead ends: 4076 [2018-02-04 17:56:29,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:56:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2018-02-04 17:56:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 2516. [2018-02-04 17:56:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2018-02-04 17:56:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 3350 transitions. [2018-02-04 17:56:29,670 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 3350 transitions. Word has length 42 [2018-02-04 17:56:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:29,670 INFO L432 AbstractCegarLoop]: Abstraction has 2516 states and 3350 transitions. [2018-02-04 17:56:29,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:56:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 3350 transitions. [2018-02-04 17:56:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 17:56:29,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:29,672 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:29,672 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1922656245, now seen corresponding path program 1 times [2018-02-04 17:56:29,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:29,672 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:29,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:29,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:29,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:29,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:56:29,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:29,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:29,780 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:29,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:56:29,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:29,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-02-04 17:56:29,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:56:29,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:56:29,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:56:29,871 INFO L87 Difference]: Start difference. First operand 2516 states and 3350 transitions. Second operand 13 states. [2018-02-04 17:56:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:30,834 INFO L93 Difference]: Finished difference Result 1714 states and 2239 transitions. [2018-02-04 17:56:30,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:56:30,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 17:56:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:30,840 INFO L225 Difference]: With dead ends: 1714 [2018-02-04 17:56:30,840 INFO L226 Difference]: Without dead ends: 1654 [2018-02-04 17:56:30,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:56:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2018-02-04 17:56:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1484. [2018-02-04 17:56:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-02-04 17:56:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1960 transitions. [2018-02-04 17:56:30,872 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1960 transitions. Word has length 43 [2018-02-04 17:56:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:30,872 INFO L432 AbstractCegarLoop]: Abstraction has 1484 states and 1960 transitions. [2018-02-04 17:56:30,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:56:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1960 transitions. [2018-02-04 17:56:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 17:56:30,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:30,873 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:30,874 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:30,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-04 17:56:30,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:30,874 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:30,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:30,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:30,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:30,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:56:30,950 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:30,950 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:30,951 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:30,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:56:31,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:31,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:56:31,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:56:31,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:56:31,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:56:31,008 INFO L87 Difference]: Start difference. First operand 1484 states and 1960 transitions. Second operand 11 states. [2018-02-04 17:56:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:31,214 INFO L93 Difference]: Finished difference Result 1951 states and 2669 transitions. [2018-02-04 17:56:31,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:56:31,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-04 17:56:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:31,219 INFO L225 Difference]: With dead ends: 1951 [2018-02-04 17:56:31,220 INFO L226 Difference]: Without dead ends: 1951 [2018-02-04 17:56:31,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:56:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-02-04 17:56:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1524. [2018-02-04 17:56:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2018-02-04 17:56:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2020 transitions. [2018-02-04 17:56:31,244 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2020 transitions. Word has length 54 [2018-02-04 17:56:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:31,244 INFO L432 AbstractCegarLoop]: Abstraction has 1524 states and 2020 transitions. [2018-02-04 17:56:31,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:56:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2020 transitions. [2018-02-04 17:56:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 17:56:31,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:31,245 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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:56:31,245 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:31,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-04 17:56:31,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:31,245 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:31,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:31,246 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:31,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:31,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 17:56:31,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:31,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:31,294 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:31,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:56:31,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:31,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-04 17:56:31,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:56:31,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:56:31,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:56:31,435 INFO L87 Difference]: Start difference. First operand 1524 states and 2020 transitions. Second operand 15 states. [2018-02-04 17:56:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:31,919 INFO L93 Difference]: Finished difference Result 2564 states and 3550 transitions. [2018-02-04 17:56:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:56:31,919 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-04 17:56:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:31,926 INFO L225 Difference]: With dead ends: 2564 [2018-02-04 17:56:31,926 INFO L226 Difference]: Without dead ends: 2514 [2018-02-04 17:56:31,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:56:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2018-02-04 17:56:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2081. [2018-02-04 17:56:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-02-04 17:56:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2776 transitions. [2018-02-04 17:56:31,968 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2776 transitions. Word has length 54 [2018-02-04 17:56:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:31,969 INFO L432 AbstractCegarLoop]: Abstraction has 2081 states and 2776 transitions. [2018-02-04 17:56:31,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:56:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2776 transitions. [2018-02-04 17:56:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 17:56:31,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:31,970 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:31,970 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-04 17:56:31,971 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:31,971 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:31,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:31,971 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:31,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:31,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 17:56:32,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:32,055 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:32,055 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:32,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 17:56:32,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:32,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:56:32,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:56:32,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:56:32,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:56:32,113 INFO L87 Difference]: Start difference. First operand 2081 states and 2776 transitions. Second operand 11 states. [2018-02-04 17:56:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:32,318 INFO L93 Difference]: Finished difference Result 2508 states and 3400 transitions. [2018-02-04 17:56:32,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:56:32,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-04 17:56:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:32,323 INFO L225 Difference]: With dead ends: 2508 [2018-02-04 17:56:32,323 INFO L226 Difference]: Without dead ends: 2508 [2018-02-04 17:56:32,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:56:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2018-02-04 17:56:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2478. [2018-02-04 17:56:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2478 states. [2018-02-04 17:56:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3372 transitions. [2018-02-04 17:56:32,354 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3372 transitions. Word has length 68 [2018-02-04 17:56:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:32,354 INFO L432 AbstractCegarLoop]: Abstraction has 2478 states and 3372 transitions. [2018-02-04 17:56:32,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:56:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3372 transitions. [2018-02-04 17:56:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 17:56:32,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:32,356 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 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:56:32,356 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:32,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-04 17:56:32,356 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:32,356 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:32,357 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:32,357 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:32,357 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:32,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 17:56:32,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:32,517 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:32,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:32,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 17:56:32,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:32,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-04 17:56:32,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:56:32,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:56:32,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:56:32,655 INFO L87 Difference]: Start difference. First operand 2478 states and 3372 transitions. Second operand 18 states. [2018-02-04 17:56:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:33,405 INFO L93 Difference]: Finished difference Result 4340 states and 6003 transitions. [2018-02-04 17:56:33,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:56:33,405 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-04 17:56:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:33,422 INFO L225 Difference]: With dead ends: 4340 [2018-02-04 17:56:33,422 INFO L226 Difference]: Without dead ends: 4280 [2018-02-04 17:56:33,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:56:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2018-02-04 17:56:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 3187. [2018-02-04 17:56:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3187 states. [2018-02-04 17:56:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 4260 transitions. [2018-02-04 17:56:33,498 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 4260 transitions. Word has length 70 [2018-02-04 17:56:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:33,498 INFO L432 AbstractCegarLoop]: Abstraction has 3187 states and 4260 transitions. [2018-02-04 17:56:33,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:56:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 4260 transitions. [2018-02-04 17:56:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 17:56:33,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:33,500 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 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:56:33,500 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-04 17:56:33,501 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:33,501 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:33,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:33,502 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:33,502 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:33,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 17:56:33,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:33,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:33,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:33,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-04 17:56:33,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:33,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 17:56:33,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:56:33,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:56:33,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:56:33,788 INFO L87 Difference]: Start difference. First operand 3187 states and 4260 transitions. Second operand 17 states. [2018-02-04 17:56:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:34,328 INFO L93 Difference]: Finished difference Result 4197 states and 5723 transitions. [2018-02-04 17:56:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:56:34,328 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-04 17:56:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:34,339 INFO L225 Difference]: With dead ends: 4197 [2018-02-04 17:56:34,339 INFO L226 Difference]: Without dead ends: 4107 [2018-02-04 17:56:34,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:56:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-02-04 17:56:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3010. [2018-02-04 17:56:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3010 states. [2018-02-04 17:56:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 3973 transitions. [2018-02-04 17:56:34,388 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 3973 transitions. Word has length 84 [2018-02-04 17:56:34,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:34,388 INFO L432 AbstractCegarLoop]: Abstraction has 3010 states and 3973 transitions. [2018-02-04 17:56:34,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:56:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 3973 transitions. [2018-02-04 17:56:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 17:56:34,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:34,389 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 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:56:34,389 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-04 17:56:34,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:34,390 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:34,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:34,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:34,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:34,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:56:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 17:56:34,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:34,468 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:34,469 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:34,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 17:56:34,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:34,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-02-04 17:56:34,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:56:34,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:56:34,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:56:34,606 INFO L87 Difference]: Start difference. First operand 3010 states and 3973 transitions. Second operand 17 states. [2018-02-04 17:56:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:35,984 INFO L93 Difference]: Finished difference Result 6632 states and 8888 transitions. [2018-02-04 17:56:35,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 17:56:35,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-02-04 17:56:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:35,996 INFO L225 Difference]: With dead ends: 6632 [2018-02-04 17:56:35,996 INFO L226 Difference]: Without dead ends: 6570 [2018-02-04 17:56:35,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1105, Invalid=5537, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 17:56:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6570 states. [2018-02-04 17:56:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6570 to 5654. [2018-02-04 17:56:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5654 states. [2018-02-04 17:56:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5654 states to 5654 states and 7604 transitions. [2018-02-04 17:56:36,058 INFO L78 Accepts]: Start accepts. Automaton has 5654 states and 7604 transitions. Word has length 87 [2018-02-04 17:56:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:36,058 INFO L432 AbstractCegarLoop]: Abstraction has 5654 states and 7604 transitions. [2018-02-04 17:56:36,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:56:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 5654 states and 7604 transitions. [2018-02-04 17:56:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 17:56:36,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:36,059 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:36,059 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:36,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-02-04 17:56:36,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:36,060 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:36,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:36,060 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:36,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:36,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-04 17:56:36,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:36,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:36,175 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:36,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-02-04 17:56:36,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:36,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-04 17:56:36,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:56:36,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:56:36,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:56:36,320 INFO L87 Difference]: Start difference. First operand 5654 states and 7604 transitions. Second operand 18 states. [2018-02-04 17:56:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:38,975 INFO L93 Difference]: Finished difference Result 12914 states and 17927 transitions. [2018-02-04 17:56:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 17:56:38,978 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-02-04 17:56:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:39,009 INFO L225 Difference]: With dead ends: 12914 [2018-02-04 17:56:39,009 INFO L226 Difference]: Without dead ends: 12914 [2018-02-04 17:56:39,012 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3820 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1614, Invalid=9942, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 17:56:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12914 states. [2018-02-04 17:56:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12914 to 9873. [2018-02-04 17:56:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9873 states. [2018-02-04 17:56:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 13624 transitions. [2018-02-04 17:56:39,269 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 13624 transitions. Word has length 99 [2018-02-04 17:56:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:39,269 INFO L432 AbstractCegarLoop]: Abstraction has 9873 states and 13624 transitions. [2018-02-04 17:56:39,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:56:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 13624 transitions. [2018-02-04 17:56:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 17:56:39,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:39,271 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:39,271 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1793769950, now seen corresponding path program 1 times [2018-02-04 17:56:39,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:39,272 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:39,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:39,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:39,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:39,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-04 17:56:39,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:39,472 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:39,472 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:39,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:39,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:56:39,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:39,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:39,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:56:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 85 proven. 91 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 17:56:39,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:39,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-02-04 17:56:39,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:56:39,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:56:39,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:56:39,779 INFO L87 Difference]: Start difference. First operand 9873 states and 13624 transitions. Second operand 22 states. [2018-02-04 17:56:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:41,427 INFO L93 Difference]: Finished difference Result 13801 states and 18950 transitions. [2018-02-04 17:56:41,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:56:41,427 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 105 [2018-02-04 17:56:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:41,451 INFO L225 Difference]: With dead ends: 13801 [2018-02-04 17:56:41,451 INFO L226 Difference]: Without dead ends: 13801 [2018-02-04 17:56:41,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=467, Invalid=2083, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:56:41,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13801 states. [2018-02-04 17:56:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13801 to 13007. [2018-02-04 17:56:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13007 states. [2018-02-04 17:56:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 17908 transitions. [2018-02-04 17:56:41,636 INFO L78 Accepts]: Start accepts. Automaton has 13007 states and 17908 transitions. Word has length 105 [2018-02-04 17:56:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:41,636 INFO L432 AbstractCegarLoop]: Abstraction has 13007 states and 17908 transitions. [2018-02-04 17:56:41,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:56:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 13007 states and 17908 transitions. [2018-02-04 17:56:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-04 17:56:41,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:41,641 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:41,641 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:41,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1854918738, now seen corresponding path program 1 times [2018-02-04 17:56:41,641 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:41,641 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:41,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:41,642 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:41,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:41,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-02-04 17:56:41,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:56:41,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:56:41,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:56:41,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:56:41,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:56:41,730 INFO L87 Difference]: Start difference. First operand 13007 states and 17908 transitions. Second operand 6 states. [2018-02-04 17:56:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:41,896 INFO L93 Difference]: Finished difference Result 20824 states and 29399 transitions. [2018-02-04 17:56:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:56:41,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-02-04 17:56:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:41,946 INFO L225 Difference]: With dead ends: 20824 [2018-02-04 17:56:41,946 INFO L226 Difference]: Without dead ends: 20824 [2018-02-04 17:56:41,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:56:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20824 states. [2018-02-04 17:56:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20824 to 20821. [2018-02-04 17:56:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20821 states. [2018-02-04 17:56:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20821 states to 20821 states and 29398 transitions. [2018-02-04 17:56:42,506 INFO L78 Accepts]: Start accepts. Automaton has 20821 states and 29398 transitions. Word has length 131 [2018-02-04 17:56:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:42,506 INFO L432 AbstractCegarLoop]: Abstraction has 20821 states and 29398 transitions. [2018-02-04 17:56:42,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:56:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20821 states and 29398 transitions. [2018-02-04 17:56:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 17:56:42,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:42,512 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:42,512 INFO L371 AbstractCegarLoop]: === Iteration 25 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:42,512 INFO L82 PathProgramCache]: Analyzing trace with hash 970215073, now seen corresponding path program 1 times [2018-02-04 17:56:42,512 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:42,512 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:42,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:42,513 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:42,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:42,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 69 proven. 127 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-02-04 17:56:42,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:42,652 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:42,652 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:42,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 210 proven. 4 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-02-04 17:56:42,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:42,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-02-04 17:56:42,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:56:42,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:56:42,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:56:42,789 INFO L87 Difference]: Start difference. First operand 20821 states and 29398 transitions. Second operand 18 states. [2018-02-04 17:56:46,428 WARN L143 SmtUtils]: Spent 181ms on a formula simplification that was a NOOP. DAG size: 24 [2018-02-04 17:56:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:46,491 INFO L93 Difference]: Finished difference Result 37614 states and 50785 transitions. [2018-02-04 17:56:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-02-04 17:56:46,491 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2018-02-04 17:56:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:46,547 INFO L225 Difference]: With dead ends: 37614 [2018-02-04 17:56:46,547 INFO L226 Difference]: Without dead ends: 36494 [2018-02-04 17:56:46,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7113 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2448, Invalid=16184, Unknown=0, NotChecked=0, Total=18632 [2018-02-04 17:56:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36494 states. [2018-02-04 17:56:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36494 to 33304. [2018-02-04 17:56:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33304 states. [2018-02-04 17:56:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33304 states to 33304 states and 45104 transitions. [2018-02-04 17:56:46,868 INFO L78 Accepts]: Start accepts. Automaton has 33304 states and 45104 transitions. Word has length 141 [2018-02-04 17:56:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:46,868 INFO L432 AbstractCegarLoop]: Abstraction has 33304 states and 45104 transitions. [2018-02-04 17:56:46,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:56:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 33304 states and 45104 transitions. [2018-02-04 17:56:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-04 17:56:46,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:46,874 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:46,874 INFO L371 AbstractCegarLoop]: === Iteration 26 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1022004672, now seen corresponding path program 1 times [2018-02-04 17:56:46,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:46,875 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:46,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:46,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:46,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:46,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 203 proven. 11 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-02-04 17:56:46,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:46,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:46,961 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:46,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 225 proven. 10 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2018-02-04 17:56:47,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:47,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 14 [2018-02-04 17:56:47,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:56:47,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:56:47,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:56:47,066 INFO L87 Difference]: Start difference. First operand 33304 states and 45104 transitions. Second operand 14 states. [2018-02-04 17:56:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:47,568 INFO L93 Difference]: Finished difference Result 25254 states and 33812 transitions. [2018-02-04 17:56:47,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:56:47,569 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-02-04 17:56:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:47,607 INFO L225 Difference]: With dead ends: 25254 [2018-02-04 17:56:47,607 INFO L226 Difference]: Without dead ends: 24038 [2018-02-04 17:56:47,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:56:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24038 states. [2018-02-04 17:56:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24038 to 20882. [2018-02-04 17:56:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20882 states. [2018-02-04 17:56:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20882 states to 20882 states and 27282 transitions. [2018-02-04 17:56:48,116 INFO L78 Accepts]: Start accepts. Automaton has 20882 states and 27282 transitions. Word has length 155 [2018-02-04 17:56:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:48,116 INFO L432 AbstractCegarLoop]: Abstraction has 20882 states and 27282 transitions. [2018-02-04 17:56:48,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:56:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 20882 states and 27282 transitions. [2018-02-04 17:56:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 17:56:48,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:48,125 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:48,125 INFO L371 AbstractCegarLoop]: === Iteration 27 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:48,125 INFO L82 PathProgramCache]: Analyzing trace with hash 61686075, now seen corresponding path program 1 times [2018-02-04 17:56:48,126 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:48,126 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:48,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:48,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:48,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:48,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:56:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 126 proven. 7 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-02-04 17:56:48,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:48,263 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:48,264 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:48,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 126 proven. 7 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-02-04 17:56:48,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:48,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:56:48,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:56:48,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:56:48,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:56:48,348 INFO L87 Difference]: Start difference. First operand 20882 states and 27282 transitions. Second operand 11 states. [2018-02-04 17:56:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:48,662 INFO L93 Difference]: Finished difference Result 14464 states and 18778 transitions. [2018-02-04 17:56:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:56:48,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2018-02-04 17:56:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:48,681 INFO L225 Difference]: With dead ends: 14464 [2018-02-04 17:56:48,681 INFO L226 Difference]: Without dead ends: 11544 [2018-02-04 17:56:48,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:56:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11544 states. [2018-02-04 17:56:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11544 to 9994. [2018-02-04 17:56:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9994 states. [2018-02-04 17:56:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9994 states to 9994 states and 12808 transitions. [2018-02-04 17:56:48,821 INFO L78 Accepts]: Start accepts. Automaton has 9994 states and 12808 transitions. Word has length 159 [2018-02-04 17:56:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:48,822 INFO L432 AbstractCegarLoop]: Abstraction has 9994 states and 12808 transitions. [2018-02-04 17:56:48,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:56:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 9994 states and 12808 transitions. [2018-02-04 17:56:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 17:56:48,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:48,827 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:48,827 INFO L371 AbstractCegarLoop]: === Iteration 28 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash 50496070, now seen corresponding path program 1 times [2018-02-04 17:56:48,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:48,827 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:48,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:48,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:48,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:48,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 162 proven. 14 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-02-04 17:56:48,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:48,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:48,931 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:48,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:48,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:56:48,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:48,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:48,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:56:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 81 proven. 260 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 17:56:49,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:49,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 15 [2018-02-04 17:56:49,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:56:49,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:56:49,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:56:49,236 INFO L87 Difference]: Start difference. First operand 9994 states and 12808 transitions. Second operand 16 states. [2018-02-04 17:56:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:50,968 INFO L93 Difference]: Finished difference Result 11729 states and 14964 transitions. [2018-02-04 17:56:50,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 17:56:50,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 162 [2018-02-04 17:56:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:50,985 INFO L225 Difference]: With dead ends: 11729 [2018-02-04 17:56:50,985 INFO L226 Difference]: Without dead ends: 11729 [2018-02-04 17:56:50,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 162 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2892, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:56:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11729 states. [2018-02-04 17:56:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11729 to 9996. [2018-02-04 17:56:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9996 states. [2018-02-04 17:56:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9996 states to 9996 states and 12812 transitions. [2018-02-04 17:56:51,082 INFO L78 Accepts]: Start accepts. Automaton has 9996 states and 12812 transitions. Word has length 162 [2018-02-04 17:56:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:51,082 INFO L432 AbstractCegarLoop]: Abstraction has 9996 states and 12812 transitions. [2018-02-04 17:56:51,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:56:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9996 states and 12812 transitions. [2018-02-04 17:56:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 17:56:51,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:51,087 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:51,087 INFO L371 AbstractCegarLoop]: === Iteration 29 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 50496071, now seen corresponding path program 1 times [2018-02-04 17:56:51,087 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:51,087 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:51,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:51,088 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:51,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:51,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 272 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 17:56:51,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:51,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:51,306 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:51,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:51,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:56:51,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:56:51,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:56:51,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:56:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 81 proven. 260 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 17:56:51,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:51,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2018-02-04 17:56:51,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:56:51,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:56:51,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:56:51,839 INFO L87 Difference]: Start difference. First operand 9996 states and 12812 transitions. Second operand 27 states. [2018-02-04 17:56:52,335 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 33 DAG size of output 24 [2018-02-04 17:56:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:56:57,191 INFO L93 Difference]: Finished difference Result 18890 states and 24800 transitions. [2018-02-04 17:56:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-02-04 17:56:57,192 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 162 [2018-02-04 17:56:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:56:57,223 INFO L225 Difference]: With dead ends: 18890 [2018-02-04 17:56:57,223 INFO L226 Difference]: Without dead ends: 18890 [2018-02-04 17:56:57,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 191 SyntacticMatches, 7 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4182 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2219, Invalid=11121, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 17:56:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18890 states. [2018-02-04 17:56:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18890 to 14296. [2018-02-04 17:56:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14296 states. [2018-02-04 17:56:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14296 states to 14296 states and 18540 transitions. [2018-02-04 17:56:57,396 INFO L78 Accepts]: Start accepts. Automaton has 14296 states and 18540 transitions. Word has length 162 [2018-02-04 17:56:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:56:57,397 INFO L432 AbstractCegarLoop]: Abstraction has 14296 states and 18540 transitions. [2018-02-04 17:56:57,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:56:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 14296 states and 18540 transitions. [2018-02-04 17:56:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-04 17:56:57,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:56:57,401 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:56:57,401 INFO L371 AbstractCegarLoop]: === Iteration 30 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:56:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1565376607, now seen corresponding path program 1 times [2018-02-04 17:56:57,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:56:57,402 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:56:57,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:57,402 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:57,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:56:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:57,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:56:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 272 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 17:56:57,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:56:57,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:56:57,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:56:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:56:57,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:56:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 185 proven. 18 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-02-04 17:56:57,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:56:57,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2018-02-04 17:56:57,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:56:57,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:56:57,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:56:57,762 INFO L87 Difference]: Start difference. First operand 14296 states and 18540 transitions. Second operand 18 states. [2018-02-04 17:57:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:01,114 INFO L93 Difference]: Finished difference Result 17506 states and 22279 transitions. [2018-02-04 17:57:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-02-04 17:57:01,114 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 163 [2018-02-04 17:57:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:01,139 INFO L225 Difference]: With dead ends: 17506 [2018-02-04 17:57:01,139 INFO L226 Difference]: Without dead ends: 17506 [2018-02-04 17:57:01,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6474 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2438, Invalid=15384, Unknown=0, NotChecked=0, Total=17822 [2018-02-04 17:57:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17506 states. [2018-02-04 17:57:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17506 to 13944. [2018-02-04 17:57:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13944 states. [2018-02-04 17:57:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13944 states to 13944 states and 17850 transitions. [2018-02-04 17:57:01,309 INFO L78 Accepts]: Start accepts. Automaton has 13944 states and 17850 transitions. Word has length 163 [2018-02-04 17:57:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:01,309 INFO L432 AbstractCegarLoop]: Abstraction has 13944 states and 17850 transitions. [2018-02-04 17:57:01,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:57:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 13944 states and 17850 transitions. [2018-02-04 17:57:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-04 17:57:01,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:01,314 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:01,314 INFO L371 AbstractCegarLoop]: === Iteration 31 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1434737638, now seen corresponding path program 1 times [2018-02-04 17:57:01,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:01,314 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:01,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:01,315 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:01,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:01,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:57:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 66 proven. 290 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-02-04 17:57:01,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:57:01,962 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:57:01,963 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:02,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:57:02,285 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 13 treesize of output 10 [2018-02-04 17:57:02,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:57:02,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:02,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:02,295 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 13 treesize of output 10 [2018-02-04 17:57:02,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:57:02,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:02,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:02,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:02,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-02-04 17:57:02,407 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:57:02,411 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:57:02,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:57:02,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:57:02,422 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:57:02,426 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:57:02,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 17:57:02,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:57:02,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:57:02,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:18 [2018-02-04 17:57:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 27 proven. 94 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2018-02-04 17:57:02,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:57:02,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 34 [2018-02-04 17:57:02,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 17:57:02,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 17:57:02,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:57:02,518 INFO L87 Difference]: Start difference. First operand 13944 states and 17850 transitions. Second operand 34 states. [2018-02-04 17:57:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:06,412 INFO L93 Difference]: Finished difference Result 22982 states and 30095 transitions. [2018-02-04 17:57:06,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 17:57:06,413 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 168 [2018-02-04 17:57:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:06,451 INFO L225 Difference]: With dead ends: 22982 [2018-02-04 17:57:06,451 INFO L226 Difference]: Without dead ends: 22922 [2018-02-04 17:57:06,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 165 SyntacticMatches, 13 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3024 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1455, Invalid=9051, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 17:57:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22922 states. [2018-02-04 17:57:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22922 to 20866. [2018-02-04 17:57:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20866 states. [2018-02-04 17:57:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20866 states to 20866 states and 26742 transitions. [2018-02-04 17:57:06,692 INFO L78 Accepts]: Start accepts. Automaton has 20866 states and 26742 transitions. Word has length 168 [2018-02-04 17:57:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:06,693 INFO L432 AbstractCegarLoop]: Abstraction has 20866 states and 26742 transitions. [2018-02-04 17:57:06,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 17:57:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 20866 states and 26742 transitions. [2018-02-04 17:57:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 17:57:06,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:06,697 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:06,697 INFO L371 AbstractCegarLoop]: === Iteration 32 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:06,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1527195381, now seen corresponding path program 1 times [2018-02-04 17:57:06,698 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:06,698 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:06,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:06,698 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:06,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:06,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:57:06,731 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:57:06,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:57:06,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:57:06,732 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:06,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:57:06,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:06,880 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 5 [2018-02-04 17:57:06,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:06,889 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:57:06,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:06,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:06,919 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 5 [2018-02-04 17:57:06,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:06,921 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:57:06,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:06,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:06,939 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 5 [2018-02-04 17:57:06,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:06,941 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:57:06,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:06,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:06,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 5 [2018-02-04 17:57:06,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:06,961 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:57:06,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:06,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:06,988 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 5 [2018-02-04 17:57:06,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:06,990 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:57:06,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:07,053 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~garbage.base Int)) (and (= |c_#valid| (store |c_old(#valid)| ~garbage.base 0)) (not (= ~garbage.base 0)) (= 0 (select |c_old(#valid)| ~garbage.base)))) is different from true [2018-02-04 17:57:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 22 proven. 319 refuted. 0 times theorem prover too weak. 133 trivial. 2 not checked. [2018-02-04 17:57:07,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:57:07,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:57:07,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:57:07,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:57:07,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=205, Unknown=1, NotChecked=28, Total=272 [2018-02-04 17:57:07,087 INFO L87 Difference]: Start difference. First operand 20866 states and 26742 transitions. Second operand 17 states. [2018-02-04 17:57:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:08,565 INFO L93 Difference]: Finished difference Result 40868 states and 52725 transitions. [2018-02-04 17:57:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:57:08,566 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 169 [2018-02-04 17:57:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:08,640 INFO L225 Difference]: With dead ends: 40868 [2018-02-04 17:57:08,640 INFO L226 Difference]: Without dead ends: 40793 [2018-02-04 17:57:08,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=337, Invalid=1922, Unknown=1, NotChecked=92, Total=2352 [2018-02-04 17:57:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40793 states. [2018-02-04 17:57:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40793 to 37993. [2018-02-04 17:57:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37993 states. [2018-02-04 17:57:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37993 states to 37993 states and 49322 transitions. [2018-02-04 17:57:09,052 INFO L78 Accepts]: Start accepts. Automaton has 37993 states and 49322 transitions. Word has length 169 [2018-02-04 17:57:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:09,053 INFO L432 AbstractCegarLoop]: Abstraction has 37993 states and 49322 transitions. [2018-02-04 17:57:09,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:57:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 37993 states and 49322 transitions. [2018-02-04 17:57:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-04 17:57:09,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:09,058 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 8, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:09,058 INFO L371 AbstractCegarLoop]: === Iteration 33 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash -427633868, now seen corresponding path program 1 times [2018-02-04 17:57:09,058 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:09,059 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:09,059 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:09,059 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:09,059 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:09,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:57:09,081 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:57:09,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:57:09,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:57:09,082 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:09,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:57:09,193 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 13 treesize of output 10 [2018-02-04 17:57:09,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:57:09,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,205 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 13 treesize of output 10 [2018-02-04 17:57:09,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:57:09,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-02-04 17:57:09,406 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:57:09,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 17:57:09,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,410 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:57:09,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 17:57:09,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:09,413 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-02-04 17:57:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 130 proven. 414 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-02-04 17:57:09,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:57:09,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 17:57:09,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:57:09,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:57:09,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:57:09,555 INFO L87 Difference]: Start difference. First operand 37993 states and 49322 transitions. Second operand 27 states. [2018-02-04 17:57:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:19,192 INFO L93 Difference]: Finished difference Result 77816 states and 100272 transitions. [2018-02-04 17:57:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-02-04 17:57:19,192 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 173 [2018-02-04 17:57:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:19,315 INFO L225 Difference]: With dead ends: 77816 [2018-02-04 17:57:19,315 INFO L226 Difference]: Without dead ends: 76912 [2018-02-04 17:57:19,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17745 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4194, Invalid=39696, Unknown=0, NotChecked=0, Total=43890 [2018-02-04 17:57:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76912 states. [2018-02-04 17:57:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76912 to 70620. [2018-02-04 17:57:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70620 states. [2018-02-04 17:57:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70620 states to 70620 states and 91176 transitions. [2018-02-04 17:57:20,086 INFO L78 Accepts]: Start accepts. Automaton has 70620 states and 91176 transitions. Word has length 173 [2018-02-04 17:57:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:20,087 INFO L432 AbstractCegarLoop]: Abstraction has 70620 states and 91176 transitions. [2018-02-04 17:57:20,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:57:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 70620 states and 91176 transitions. [2018-02-04 17:57:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-04 17:57:20,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:20,098 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:20,098 INFO L371 AbstractCegarLoop]: === Iteration 34 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:20,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1119212485, now seen corresponding path program 2 times [2018-02-04 17:57:20,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:20,099 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:20,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:20,099 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:20,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:20,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:57:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2018-02-04 17:57:20,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:57:20,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:57:20,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:57:20,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:57:20,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:57:20,180 INFO L87 Difference]: Start difference. First operand 70620 states and 91176 transitions. Second operand 5 states. [2018-02-04 17:57:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:20,305 INFO L93 Difference]: Finished difference Result 61160 states and 78484 transitions. [2018-02-04 17:57:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:57:20,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2018-02-04 17:57:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:20,402 INFO L225 Difference]: With dead ends: 61160 [2018-02-04 17:57:20,402 INFO L226 Difference]: Without dead ends: 61154 [2018-02-04 17:57:20,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:57:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61154 states. [2018-02-04 17:57:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61154 to 61055. [2018-02-04 17:57:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61055 states. [2018-02-04 17:57:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61055 states to 61055 states and 78361 transitions. [2018-02-04 17:57:20,999 INFO L78 Accepts]: Start accepts. Automaton has 61055 states and 78361 transitions. Word has length 179 [2018-02-04 17:57:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:20,999 INFO L432 AbstractCegarLoop]: Abstraction has 61055 states and 78361 transitions. [2018-02-04 17:57:20,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:57:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 61055 states and 78361 transitions. [2018-02-04 17:57:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 17:57:21,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:21,009 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:21,009 INFO L371 AbstractCegarLoop]: === Iteration 35 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1395500129, now seen corresponding path program 2 times [2018-02-04 17:57:21,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:21,009 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:21,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:21,010 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:57:21,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:21,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:57:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 332 proven. 4 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2018-02-04 17:57:21,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:57:21,151 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:57:21,152 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:57:21,197 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:57:21,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:57:21,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:57:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 309 proven. 4 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2018-02-04 17:57:21,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:57:21,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:57:21,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:57:21,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:57:21,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:57:21,258 INFO L87 Difference]: Start difference. First operand 61055 states and 78361 transitions. Second operand 11 states. [2018-02-04 17:57:21,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:21,628 INFO L93 Difference]: Finished difference Result 73826 states and 94461 transitions. [2018-02-04 17:57:21,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:57:21,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2018-02-04 17:57:21,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:21,744 INFO L225 Difference]: With dead ends: 73826 [2018-02-04 17:57:21,744 INFO L226 Difference]: Without dead ends: 72977 [2018-02-04 17:57:21,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:57:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72977 states. [2018-02-04 17:57:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72977 to 72328. [2018-02-04 17:57:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72328 states. [2018-02-04 17:57:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72328 states to 72328 states and 92773 transitions. [2018-02-04 17:57:22,543 INFO L78 Accepts]: Start accepts. Automaton has 72328 states and 92773 transitions. Word has length 185 [2018-02-04 17:57:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:22,543 INFO L432 AbstractCegarLoop]: Abstraction has 72328 states and 92773 transitions. [2018-02-04 17:57:22,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:57:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 72328 states and 92773 transitions. [2018-02-04 17:57:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 17:57:22,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:22,553 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:22,553 INFO L371 AbstractCegarLoop]: === Iteration 36 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:22,553 INFO L82 PathProgramCache]: Analyzing trace with hash 654212829, now seen corresponding path program 3 times [2018-02-04 17:57:22,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:22,553 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:22,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:22,554 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:57:22,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:22,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:57:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 335 proven. 6 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2018-02-04 17:57:22,656 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:57:22,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:57:22,657 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:57:22,708 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-04 17:57:22,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:57:22,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:57:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 312 proven. 6 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2018-02-04 17:57:22,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:57:22,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 17:57:22,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:57:22,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:57:22,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:57:22,761 INFO L87 Difference]: Start difference. First operand 72328 states and 92773 transitions. Second operand 11 states. [2018-02-04 17:57:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:23,068 INFO L93 Difference]: Finished difference Result 42146 states and 52327 transitions. [2018-02-04 17:57:23,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:57:23,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2018-02-04 17:57:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:23,139 INFO L225 Difference]: With dead ends: 42146 [2018-02-04 17:57:23,140 INFO L226 Difference]: Without dead ends: 41046 [2018-02-04 17:57:23,140 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:57:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41046 states. [2018-02-04 17:57:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41046 to 40669. [2018-02-04 17:57:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40669 states. [2018-02-04 17:57:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40669 states to 40669 states and 50553 transitions. [2018-02-04 17:57:23,535 INFO L78 Accepts]: Start accepts. Automaton has 40669 states and 50553 transitions. Word has length 187 [2018-02-04 17:57:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:23,536 INFO L432 AbstractCegarLoop]: Abstraction has 40669 states and 50553 transitions. [2018-02-04 17:57:23,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:57:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 40669 states and 50553 transitions. [2018-02-04 17:57:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-04 17:57:23,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:23,541 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:23,541 INFO L371 AbstractCegarLoop]: === Iteration 37 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2065784675, now seen corresponding path program 1 times [2018-02-04 17:57:23,541 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:23,541 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:23,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:23,542 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:57:23,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:23,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:57:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 331 proven. 64 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-02-04 17:57:23,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:57:23,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:57:23,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:23,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:57:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 370 proven. 16 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-02-04 17:57:24,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:57:24,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2018-02-04 17:57:24,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:57:24,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:57:24,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:57:24,849 INFO L87 Difference]: Start difference. First operand 40669 states and 50553 transitions. Second operand 16 states. [2018-02-04 17:57:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:27,146 INFO L93 Difference]: Finished difference Result 65118 states and 81170 transitions. [2018-02-04 17:57:27,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-02-04 17:57:27,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 191 [2018-02-04 17:57:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:27,254 INFO L225 Difference]: With dead ends: 65118 [2018-02-04 17:57:27,254 INFO L226 Difference]: Without dead ends: 61306 [2018-02-04 17:57:27,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1657, Invalid=13105, Unknown=0, NotChecked=0, Total=14762 [2018-02-04 17:57:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61306 states. [2018-02-04 17:57:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61306 to 58974. [2018-02-04 17:57:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58974 states. [2018-02-04 17:57:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58974 states to 58974 states and 73815 transitions. [2018-02-04 17:57:27,851 INFO L78 Accepts]: Start accepts. Automaton has 58974 states and 73815 transitions. Word has length 191 [2018-02-04 17:57:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:27,851 INFO L432 AbstractCegarLoop]: Abstraction has 58974 states and 73815 transitions. [2018-02-04 17:57:27,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:57:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 58974 states and 73815 transitions. [2018-02-04 17:57:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-04 17:57:27,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:27,859 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 11, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:27,859 INFO L371 AbstractCegarLoop]: === Iteration 38 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:27,859 INFO L82 PathProgramCache]: Analyzing trace with hash -178198623, now seen corresponding path program 2 times [2018-02-04 17:57:27,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:27,859 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:27,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:27,860 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:27,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:27,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:57:27,886 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:57:27,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:57:27,886 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:57:27,887 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:57:28,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:57:28,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:57:28,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:57:28,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:28,107 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 5 [2018-02-04 17:57:28,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:28,110 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:57:28,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:28,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:28,149 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 5 [2018-02-04 17:57:28,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:28,153 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:57:28,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:28,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:28,178 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 5 [2018-02-04 17:57:28,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:28,181 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:57:28,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:28,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:28,205 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 5 [2018-02-04 17:57:28,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:28,207 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:57:28,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:28,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:28,227 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 5 [2018-02-04 17:57:28,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:28,229 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:57:28,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:28,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:28,266 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 5 [2018-02-04 17:57:28,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:28,269 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:57:28,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:28,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:28,295 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 5 [2018-02-04 17:57:28,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:28,297 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:57:28,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:57:28,334 WARN L1033 $PredicateComparison]: unable to prove that (exists ((~garbage.base Int)) (and (= |c_#valid| (store |c_old(#valid)| ~garbage.base 0)) (not (= ~garbage.base 0)) (= 0 (select |c_old(#valid)| ~garbage.base)))) is different from true [2018-02-04 17:57:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 22 proven. 484 refuted. 0 times theorem prover too weak. 151 trivial. 2 not checked. [2018-02-04 17:57:28,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:57:28,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:57:28,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:57:28,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:57:28,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=235, Unknown=1, NotChecked=30, Total=306 [2018-02-04 17:57:28,380 INFO L87 Difference]: Start difference. First operand 58974 states and 73815 transitions. Second operand 18 states. [2018-02-04 17:57:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:29,887 INFO L93 Difference]: Finished difference Result 60900 states and 76130 transitions. [2018-02-04 17:57:29,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:57:29,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 191 [2018-02-04 17:57:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:29,985 INFO L225 Difference]: With dead ends: 60900 [2018-02-04 17:57:29,985 INFO L226 Difference]: Without dead ends: 60890 [2018-02-04 17:57:29,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 166 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=368, Invalid=2185, Unknown=1, NotChecked=98, Total=2652 [2018-02-04 17:57:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60890 states. [2018-02-04 17:57:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60890 to 59644. [2018-02-04 17:57:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59644 states. [2018-02-04 17:57:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59644 states to 59644 states and 74706 transitions. [2018-02-04 17:57:30,572 INFO L78 Accepts]: Start accepts. Automaton has 59644 states and 74706 transitions. Word has length 191 [2018-02-04 17:57:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:30,572 INFO L432 AbstractCegarLoop]: Abstraction has 59644 states and 74706 transitions. [2018-02-04 17:57:30,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:57:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 59644 states and 74706 transitions. [2018-02-04 17:57:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 17:57:30,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:30,583 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:30,583 INFO L371 AbstractCegarLoop]: === Iteration 39 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:30,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1992863642, now seen corresponding path program 1 times [2018-02-04 17:57:30,583 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:30,583 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:30,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:30,583 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:57:30,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:30,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:57:30,842 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:57:30,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:57:30,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:57:30,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:30,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:57:30,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:57:30,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:30,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:30,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 17:57:30,965 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 13 treesize of output 10 [2018-02-04 17:57:30,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:57:30,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:30,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:30,976 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 13 treesize of output 10 [2018-02-04 17:57:30,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:57:30,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:30,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:30,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:30,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-02-04 17:57:31,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:31,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:31,118 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:31,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:31,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:31,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:44 [2018-02-04 17:57:31,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:31,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:31,156 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:57:31,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,168 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 26 treesize of output 27 [2018-02-04 17:57:31,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-02-04 17:57:31,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:31,173 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 16 treesize of output 23 [2018-02-04 17:57:31,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,193 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 26 treesize of output 27 [2018-02-04 17:57:31,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 17:57:31,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:31,196 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 16 treesize of output 23 [2018-02-04 17:57:31,196 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,198 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,202 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:31,209 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:67, output treesize:47 [2018-02-04 17:57:31,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:57:31,587 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:57:31,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 17:57:31,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:31,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:57:31,602 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:57:31,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 17:57:31,602 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:31,606 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:31,611 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2018-02-04 17:57:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 208 proven. 568 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 17:57:31,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:57:31,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 17:57:31,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 17:57:31,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 17:57:31,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1437, Unknown=4, NotChecked=0, Total=1560 [2018-02-04 17:57:31,795 INFO L87 Difference]: Start difference. First operand 59644 states and 74706 transitions. Second operand 40 states. [2018-02-04 17:57:37,611 WARN L146 SmtUtils]: Spent 503ms on a formula simplification. DAG size of input: 86 DAG size of output 81 [2018-02-04 17:57:38,261 WARN L146 SmtUtils]: Spent 499ms on a formula simplification. DAG size of input: 80 DAG size of output 75 [2018-02-04 17:57:39,204 WARN L146 SmtUtils]: Spent 504ms on a formula simplification. DAG size of input: 84 DAG size of output 79 [2018-02-04 17:57:40,095 WARN L146 SmtUtils]: Spent 528ms on a formula simplification. DAG size of input: 89 DAG size of output 84 [2018-02-04 17:57:42,042 WARN L146 SmtUtils]: Spent 506ms on a formula simplification. DAG size of input: 88 DAG size of output 83 [2018-02-04 17:57:43,859 WARN L146 SmtUtils]: Spent 466ms on a formula simplification. DAG size of input: 68 DAG size of output 67 [2018-02-04 17:57:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:57:46,297 INFO L93 Difference]: Finished difference Result 84835 states and 105964 transitions. [2018-02-04 17:57:46,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-02-04 17:57:46,297 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 202 [2018-02-04 17:57:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:57:46,442 INFO L225 Difference]: With dead ends: 84835 [2018-02-04 17:57:46,443 INFO L226 Difference]: Without dead ends: 83679 [2018-02-04 17:57:46,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10780 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2584, Invalid=27467, Unknown=51, NotChecked=0, Total=30102 [2018-02-04 17:57:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83679 states. [2018-02-04 17:57:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83679 to 78519. [2018-02-04 17:57:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78519 states. [2018-02-04 17:57:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78519 states to 78519 states and 98421 transitions. [2018-02-04 17:57:47,212 INFO L78 Accepts]: Start accepts. Automaton has 78519 states and 98421 transitions. Word has length 202 [2018-02-04 17:57:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:57:47,213 INFO L432 AbstractCegarLoop]: Abstraction has 78519 states and 98421 transitions. [2018-02-04 17:57:47,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 17:57:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 78519 states and 98421 transitions. [2018-02-04 17:57:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 17:57:47,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:57:47,229 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:57:47,229 INFO L371 AbstractCegarLoop]: === Iteration 40 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:57:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash -337430106, now seen corresponding path program 2 times [2018-02-04 17:57:47,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:57:47,230 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:57:47,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:47,230 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:57:47,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:57:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:57:47,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:57:47,262 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:57:47,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:57:47,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:57:47,262 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:57:47,357 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:57:47,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:57:47,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:57:47,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:57:47,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:57:47,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:47,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 17:57:47,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:20 [2018-02-04 17:57:47,509 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 13 treesize of output 10 [2018-02-04 17:57:47,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:57:47,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,523 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 13 treesize of output 10 [2018-02-04 17:57:47,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:57:47,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-02-04 17:57:47,675 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 9 treesize of output 7 [2018-02-04 17:57:47,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:47,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,688 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 9 treesize of output 7 [2018-02-04 17:57:47,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:47,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:47,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:23 [2018-02-04 17:57:47,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:47,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:47,777 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:57:47,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,785 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 9 treesize of output 7 [2018-02-04 17:57:47,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:47,786 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,793 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 9 treesize of output 7 [2018-02-04 17:57:47,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:47,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,795 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,800 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 [2018-02-04 17:57:47,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:47,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:47,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:47,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:47,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:47,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:60 [2018-02-04 17:57:47,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:47,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:47,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:47,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-02-04 17:57:47,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,968 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 26 treesize of output 27 [2018-02-04 17:57:47,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-02-04 17:57:47,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:47,972 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 16 treesize of output 23 [2018-02-04 17:57:47,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:47,997 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 26 treesize of output 27 [2018-02-04 17:57:47,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-02-04 17:57:48,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:57:48,001 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 16 treesize of output 23 [2018-02-04 17:57:48,001 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,004 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:48,021 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:85, output treesize:65 [2018-02-04 17:57:48,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:57:48,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,088 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:57:48,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,108 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,111 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,112 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:48,120 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:77, output treesize:32 [2018-02-04 17:57:48,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:57:48,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:57:48,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,215 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,216 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:48,225 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:77, output treesize:32 [2018-02-04 17:57:48,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:57:48,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,390 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:57:48,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,413 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,417 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:48,431 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:41 [2018-02-04 17:57:48,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:57:48,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:57:48,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,633 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,634 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:48,642 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:77, output treesize:32 [2018-02-04 17:57:48,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:57:48,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 17:57:48,728 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:57:48,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 17:57:48,746 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:57:48,750 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,751 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:57:48,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 17:57:48,762 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:100, output treesize:40 [2018-02-04 17:57:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 204 proven. 577 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 17:57:49,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:57:49,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 17:57:49,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 17:57:49,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 17:57:49,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1663, Unknown=4, NotChecked=0, Total=1806 [2018-02-04 17:57:49,316 INFO L87 Difference]: Start difference. First operand 78519 states and 98421 transitions. Second operand 43 states. [2018-02-04 17:57:58,058 WARN L146 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 122 DAG size of output 79 [2018-02-04 17:58:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:58:02,790 INFO L93 Difference]: Finished difference Result 88855 states and 110757 transitions. [2018-02-04 17:58:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-02-04 17:58:02,790 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-04 17:58:02,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:58:02,926 INFO L225 Difference]: With dead ends: 88855 [2018-02-04 17:58:02,926 INFO L226 Difference]: Without dead ends: 88839 [2018-02-04 17:58:02,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4859 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1679, Invalid=15065, Unknown=26, NotChecked=0, Total=16770 [2018-02-04 17:58:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88839 states. [2018-02-04 17:58:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88839 to 86754. [2018-02-04 17:58:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86754 states. [2018-02-04 17:58:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86754 states to 86754 states and 108367 transitions. [2018-02-04 17:58:03,683 INFO L78 Accepts]: Start accepts. Automaton has 86754 states and 108367 transitions. Word has length 202 [2018-02-04 17:58:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:58:03,684 INFO L432 AbstractCegarLoop]: Abstraction has 86754 states and 108367 transitions. [2018-02-04 17:58:03,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 17:58:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 86754 states and 108367 transitions. [2018-02-04 17:58:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-04 17:58:03,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:58:03,701 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:58:03,701 INFO L371 AbstractCegarLoop]: === Iteration 41 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:58:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash -775616711, now seen corresponding path program 1 times [2018-02-04 17:58:03,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:58:03,702 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:58:03,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:58:03,702 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:58:03,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:58:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:58:03,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:58:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 290 proven. 42 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2018-02-04 17:58:03,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:58:03,877 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:58:03,877 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:58:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:58:03,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:58:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 279 proven. 4 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2018-02-04 17:58:03,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:58:03,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-02-04 17:58:03,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:58:03,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:58:03,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:58:03,969 INFO L87 Difference]: Start difference. First operand 86754 states and 108367 transitions. Second operand 15 states. [2018-02-04 17:58:04,241 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 28 DAG size of output 18 [2018-02-04 17:58:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:58:04,632 INFO L93 Difference]: Finished difference Result 85854 states and 104881 transitions. [2018-02-04 17:58:04,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:58:04,632 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 206 [2018-02-04 17:58:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:58:04,752 INFO L225 Difference]: With dead ends: 85854 [2018-02-04 17:58:04,752 INFO L226 Difference]: Without dead ends: 82366 [2018-02-04 17:58:04,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:58:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82366 states. [2018-02-04 17:58:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82366 to 76688. [2018-02-04 17:58:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76688 states. [2018-02-04 17:58:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76688 states to 76688 states and 94268 transitions. [2018-02-04 17:58:05,467 INFO L78 Accepts]: Start accepts. Automaton has 76688 states and 94268 transitions. Word has length 206 [2018-02-04 17:58:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:58:05,468 INFO L432 AbstractCegarLoop]: Abstraction has 76688 states and 94268 transitions. [2018-02-04 17:58:05,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:58:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 76688 states and 94268 transitions. [2018-02-04 17:58:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-04 17:58:05,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:58:05,483 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:58:05,483 INFO L371 AbstractCegarLoop]: === Iteration 42 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:58:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash 396748435, now seen corresponding path program 3 times [2018-02-04 17:58:05,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:58:05,483 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:58:05,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:58:05,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:58:05,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:58:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:58:05,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:58:05,540 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:58:05,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:58:05,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:58:05,541 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:58:05,640 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-02-04 17:58:05,641 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:58:05,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:58:05,682 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 13 treesize of output 10 [2018-02-04 17:58:05,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:58:05,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,697 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 13 treesize of output 10 [2018-02-04 17:58:05,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:58:05,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-02-04 17:58:05,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:05,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:05,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:05,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:05,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:05,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:47 [2018-02-04 17:58:05,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:05,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:05,941 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:58:05,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,955 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 26 treesize of output 27 [2018-02-04 17:58:05,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-02-04 17:58:05,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:05,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 16 treesize of output 23 [2018-02-04 17:58:05,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,981 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 26 treesize of output 27 [2018-02-04 17:58:05,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-02-04 17:58:05,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:05,985 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 16 treesize of output 23 [2018-02-04 17:58:05,985 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,988 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:05,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:06,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:06,001 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:64, output treesize:44 [2018-02-04 17:58:06,064 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 34 treesize of output 33 [2018-02-04 17:58:06,071 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 20 treesize of output 15 [2018-02-04 17:58:06,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:58:06,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:58:06,094 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 34 treesize of output 33 [2018-02-04 17:58:06,101 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 20 treesize of output 15 [2018-02-04 17:58:06,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 17:58:06,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:58:06,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-02-04 17:58:06,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:133 [2018-02-04 17:58:06,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:58:06,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:06,535 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:58:06,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 17:58:06,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:06,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:06,540 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:58:06,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 17:58:06,541 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:06,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:06,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:06,544 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:42, output treesize:7 [2018-02-04 17:58:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 267 proven. 560 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-02-04 17:58:06,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:58:06,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 17:58:06,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 17:58:06,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 17:58:06,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1133, Unknown=2, NotChecked=0, Total=1260 [2018-02-04 17:58:06,782 INFO L87 Difference]: Start difference. First operand 76688 states and 94268 transitions. Second operand 36 states. [2018-02-04 17:58:30,514 WARN L143 SmtUtils]: Spent 2095ms on a formula simplification that was a NOOP. DAG size: 55 [2018-02-04 17:58:37,272 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 60 [2018-02-04 17:58:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:58:37,452 INFO L93 Difference]: Finished difference Result 84269 states and 103219 transitions. [2018-02-04 17:58:37,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-02-04 17:58:37,453 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 214 [2018-02-04 17:58:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:58:37,589 INFO L225 Difference]: With dead ends: 84269 [2018-02-04 17:58:37,589 INFO L226 Difference]: Without dead ends: 83973 [2018-02-04 17:58:37,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10068 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2777, Invalid=25929, Unknown=24, NotChecked=0, Total=28730 [2018-02-04 17:58:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83973 states. [2018-02-04 17:58:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83973 to 81807. [2018-02-04 17:58:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81807 states. [2018-02-04 17:58:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81807 states to 81807 states and 100438 transitions. [2018-02-04 17:58:38,492 INFO L78 Accepts]: Start accepts. Automaton has 81807 states and 100438 transitions. Word has length 214 [2018-02-04 17:58:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:58:38,492 INFO L432 AbstractCegarLoop]: Abstraction has 81807 states and 100438 transitions. [2018-02-04 17:58:38,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 17:58:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 81807 states and 100438 transitions. [2018-02-04 17:58:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-04 17:58:38,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:58:38,509 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:58:38,509 INFO L371 AbstractCegarLoop]: === Iteration 43 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:58:38,510 INFO L82 PathProgramCache]: Analyzing trace with hash 403388819, now seen corresponding path program 4 times [2018-02-04 17:58:38,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:58:38,510 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:58:38,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:58:38,510 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:58:38,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:58:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:58:38,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:58:38,535 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:58:38,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:58:38,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:58:38,535 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:58:38,589 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:58:38,589 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:58:38,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:58:38,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:58:38,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:58:38,693 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 13 treesize of output 10 [2018-02-04 17:58:38,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:58:38,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,709 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 13 treesize of output 10 [2018-02-04 17:58:38,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:58:38,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-02-04 17:58:38,875 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:38,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:38,887 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:38,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:38,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:38,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-02-04 17:58:38,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:38,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:38,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:58:38,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,949 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 26 treesize of output 27 [2018-02-04 17:58:38,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 17:58:38,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:38,953 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 16 treesize of output 23 [2018-02-04 17:58:38,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,971 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 26 treesize of output 27 [2018-02-04 17:58:38,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-02-04 17:58:38,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:38,975 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 16 treesize of output 23 [2018-02-04 17:58:38,976 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,979 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,982 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:38,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:38,989 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:61, output treesize:41 [2018-02-04 17:58:39,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:58:39,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:58:39,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,028 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,031 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,036 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:53, output treesize:13 [2018-02-04 17:58:39,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:58:39,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,105 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:58:39,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,114 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,117 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,118 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,122 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:53, output treesize:13 [2018-02-04 17:58:39,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:58:39,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 17:58:39,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,156 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,159 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,159 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,163 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:53, output treesize:13 [2018-02-04 17:58:39,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:58:39,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 17:58:39,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:39,217 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:35 [2018-02-04 17:58:39,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:58:39,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:39,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 17:58:39,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:39,252 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:58:39,252 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:13 [2018-02-04 17:58:39,295 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 43 treesize of output 42 [2018-02-04 17:58:39,301 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 20 treesize of output 15 [2018-02-04 17:58:39,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:58:39,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:58:39,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 17:58:39,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:46 [2018-02-04 17:58:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 135 proven. 754 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-02-04 17:58:39,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:58:39,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 17:58:39,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 17:58:39,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 17:58:39,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1449, Unknown=2, NotChecked=0, Total=1560 [2018-02-04 17:58:39,597 INFO L87 Difference]: Start difference. First operand 81807 states and 100438 transitions. Second operand 40 states. [2018-02-04 17:58:45,901 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-02-04 17:58:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:58:51,208 INFO L93 Difference]: Finished difference Result 93926 states and 114938 transitions. [2018-02-04 17:58:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-02-04 17:58:51,209 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 214 [2018-02-04 17:58:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:58:51,338 INFO L225 Difference]: With dead ends: 93926 [2018-02-04 17:58:51,338 INFO L226 Difference]: Without dead ends: 93479 [2018-02-04 17:58:51,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9406 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2436, Invalid=26267, Unknown=27, NotChecked=0, Total=28730 [2018-02-04 17:58:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93479 states. [2018-02-04 17:58:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93479 to 88533. [2018-02-04 17:58:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88533 states. [2018-02-04 17:58:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88533 states to 88533 states and 108514 transitions. [2018-02-04 17:58:52,133 INFO L78 Accepts]: Start accepts. Automaton has 88533 states and 108514 transitions. Word has length 214 [2018-02-04 17:58:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:58:52,133 INFO L432 AbstractCegarLoop]: Abstraction has 88533 states and 108514 transitions. [2018-02-04 17:58:52,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 17:58:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 88533 states and 108514 transitions. [2018-02-04 17:58:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-04 17:58:52,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:58:52,152 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:58:52,152 INFO L371 AbstractCegarLoop]: === Iteration 44 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 17:58:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1276951853, now seen corresponding path program 5 times [2018-02-04 17:58:52,152 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:58:52,152 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:58:52,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:58:52,153 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:58:52,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:58:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:58:52,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:58:52,175 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:58:52,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:58:52,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:58:52,175 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:58:52,222 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:58:52,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:58:52,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:58:52,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:58:52,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 17:58:52,344 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 13 treesize of output 10 [2018-02-04 17:58:52,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 10 treesize of output 9 [2018-02-04 17:58:52,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,356 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 13 treesize of output 10 [2018-02-04 17:58:52,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:58:52,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-02-04 17:58:52,484 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 7 treesize of output 5 [2018-02-04 17:58:52,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,496 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 7 treesize of output 5 [2018-02-04 17:58:52,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:52,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-02-04 17:58:52,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:58:52,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,618 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 7 treesize of output 5 [2018-02-04 17:58:52,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,626 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 7 treesize of output 5 [2018-02-04 17:58:52,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,848 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-02-04 17:58:52,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:52,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:52,919 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:52,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:52,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:52,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2018-02-04 17:58:52,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:52,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:52,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:58:52,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,971 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:58:52,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-02-04 17:58:52,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:52,975 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 16 treesize of output 23 [2018-02-04 17:58:52,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:52,993 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:58:52,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-02-04 17:58:52,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:58:52,997 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 16 treesize of output 23 [2018-02-04 17:58:52,997 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,000 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,005 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:53,012 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:60, output treesize:40 [2018-02-04 17:58:53,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2018-02-04 17:58:53,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:53,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2018-02-04 17:58:53,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:53,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:13 [2018-02-04 17:58:53,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2018-02-04 17:58:53,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:53,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2018-02-04 17:58:53,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:53,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:13 [2018-02-04 17:58:53,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-02-04 17:58:53,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 17:58:53,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:53,150 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:58:53,155 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 [2018-02-04 17:58:53,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-02-04 17:58:53,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 17:58:53,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 17:58:53,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:58:53,195 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:58:53,195 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:13 [2018-02-04 17:58:53,246 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 39 treesize of output 38 [2018-02-04 17:58:53,253 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 20 treesize of output 15 [2018-02-04 17:58:53,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:58:53,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:58:53,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 17:58:53,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:42 [2018-02-04 17:58:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 155 proven. 740 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 17:58:53,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:58:53,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 17:58:53,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 17:58:53,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 17:58:53,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1610, Unknown=2, NotChecked=0, Total=1722 [2018-02-04 17:58:53,544 INFO L87 Difference]: Start difference. First operand 88533 states and 108514 transitions. Second operand 42 states. [2018-02-04 17:58:56,749 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 86 DAG size of output 76 [2018-02-04 17:59:02,047 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 65 DAG size of output 63 [2018-02-04 17:59:03,192 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 100 DAG size of output 84 [2018-02-04 17:59:05,310 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 82 DAG size of output 78 Received shutdown request... [2018-02-04 17:59:09,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-02-04 17:59:09,536 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:59:09,540 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:59:09,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:59:09 BoogieIcfgContainer [2018-02-04 17:59:09,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:59:09,541 INFO L168 Benchmark]: Toolchain (without parser) took 166230.58 ms. Allocated memory was 403.2 MB in the beginning and 2.5 GB in the end (delta: 2.1 GB). Free memory was 360.1 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 862.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:59:09,541 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:59:09,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.37 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:59:09,542 INFO L168 Benchmark]: Boogie Preprocessor took 27.85 ms. Allocated memory is still 403.2 MB. Free memory was 349.5 MB in the beginning and 346.8 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:59:09,542 INFO L168 Benchmark]: RCFGBuilder took 283.95 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 319.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. [2018-02-04 17:59:09,542 INFO L168 Benchmark]: TraceAbstraction took 165749.21 ms. Allocated memory was 403.2 MB in the beginning and 2.5 GB in the end (delta: 2.1 GB). Free memory was 319.4 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 821.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:59:09,543 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 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.37 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.85 ms. Allocated memory is still 403.2 MB. Free memory was 349.5 MB in the beginning and 346.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 283.95 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 319.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 165749.21 ms. Allocated memory was 403.2 MB in the beginning and 2.5 GB in the end (delta: 2.1 GB). Free memory was 319.4 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 821.9 MB. 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 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (88533states) and interpolant automaton (currently 182 states, 42 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 219 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 165.7s OverallTime, 44 OverallIterations, 16 TraceHistogramMax, 136.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6250 SDtfs, 34988 SDslu, 23183 SDs, 0 SdLazy, 95856 SolverSat, 11882 SolverUnsat, 390 SolverUnknown, 0 SolverNotchecked, 63.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7035 GetRequests, 4438 SyntacticMatches, 70 SemanticMatches, 2526 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 109188 ImplicationChecksByTransitivity, 69.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88533occurred in iteration=43, 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: 11.5s AutomataMinimizationTime, 43 MinimizatonAttempts, 65428 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 9022 NumberOfCodeBlocks, 8915 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 7374 ConstructedInterpolants, 385 QuantifiedInterpolants, 8208392 SizeOfPredicates, 282 NumberOfNonLiveVariables, 26869 ConjunctsInSsa, 2262 ConjunctsInUnsatCore, 69 InterpolantComputations, 14 PerfectInterpolantSequences, 14584/21287 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/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-59-09-549.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-59-09-549.csv Completed graceful shutdown