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-a74eeac-m [2018-02-02 21:02:49,604 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:02:49,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:02:49,614 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:02:49,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:02:49,615 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:02:49,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:02:49,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:02:49,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:02:49,620 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:02:49,621 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:02:49,621 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:02:49,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:02:49,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:02:49,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:02:49,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:02:49,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:02:49,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:02:49,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:02:49,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:02:49,632 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:02:49,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:02:49,633 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:02:49,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:02:49,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:02:49,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:02:49,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:02:49,636 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:02:49,636 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:02:49,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:02:49,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:02:49,637 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-02 21:02:49,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:02:49,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:02:49,648 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:02:49,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:02:49,648 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:02:49,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:02:49,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:02:49,649 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:02:49,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:02:49,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:02:49,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:02:49,650 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:02:49,650 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:02:49,650 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:02:49,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:02:49,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:02:49,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:02:49,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:02:49,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:02:49,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:02:49,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:02:49,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:02:49,651 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:02:49,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:02:49,652 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:02:49,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:02:49,690 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:02:49,695 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:02:49,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:02:49,696 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:02:49,697 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-02 21:02:49,839 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:02:49,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:02:49,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:02:49,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:02:49,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:02:49,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:02:49" (1/1) ... [2018-02-02 21:02:49,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76dc9dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49, skipping insertion in model container [2018-02-02 21:02:49,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:02:49" (1/1) ... [2018-02-02 21:02:49,863 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:02:49,890 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:02:49,974 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:02:49,987 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:02:49,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49 WrapperNode [2018-02-02 21:02:49,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:02:49,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:02:49,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:02:49,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:02:50,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49" (1/1) ... [2018-02-02 21:02:50,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49" (1/1) ... [2018-02-02 21:02:50,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49" (1/1) ... [2018-02-02 21:02:50,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49" (1/1) ... [2018-02-02 21:02:50,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49" (1/1) ... [2018-02-02 21:02:50,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49" (1/1) ... [2018-02-02 21:02:50,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49" (1/1) ... [2018-02-02 21:02:50,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:02:50,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:02:50,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:02:50,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:02:50,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49" (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-02 21:02:50,060 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:02:50,061 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:02:50,061 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-02 21:02:50,061 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-02 21:02:50,061 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:02:50,061 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 21:02:50,061 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 21:02:50,061 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:02:50,062 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:02:50,279 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:02:50,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:02:50 BoogieIcfgContainer [2018-02-02 21:02:50,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:02:50,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:02:50,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:02:50,282 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:02:50,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:02:49" (1/3) ... [2018-02-02 21:02:50,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b59332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:02:50, skipping insertion in model container [2018-02-02 21:02:50,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:02:49" (2/3) ... [2018-02-02 21:02:50,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b59332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:02:50, skipping insertion in model container [2018-02-02 21:02:50,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:02:50" (3/3) ... [2018-02-02 21:02:50,285 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-02-02 21:02:50,290 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:02:50,295 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 21:02:50,323 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:02:50,323 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:02:50,323 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:02:50,323 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:02:50,323 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:02:50,324 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:02:50,324 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:02:50,324 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:02:50,324 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:02:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-02 21:02:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 21:02:50,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:50,344 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:50,344 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-02 21:02:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-02 21:02:50,349 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:50,349 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:50,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:50,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:50,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:50,474 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-02 21:02:50,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:02:50,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:02:50,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 21:02:50,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 21:02:50,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 21:02:50,492 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-02 21:02:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:50,511 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-02 21:02:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 21:02:50,512 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-02 21:02:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:50,585 INFO L225 Difference]: With dead ends: 76 [2018-02-02 21:02:50,585 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 21:02:50,586 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-02 21:02:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 21:02:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 21:02:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 21:02:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-02 21:02:50,617 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-02 21:02:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:50,618 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-02 21:02:50,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 21:02:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-02 21:02:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 21:02:50,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:50,618 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:50,619 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-02 21:02:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-02 21:02:50,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:50,619 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:50,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:50,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:50,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:50,664 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-02 21:02:50,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:02:50,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 21:02:50,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:02:50,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:02:50,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:02:50,667 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-02 21:02:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:50,682 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-02 21:02:50,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:02:50,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 21:02:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:50,683 INFO L225 Difference]: With dead ends: 74 [2018-02-02 21:02:50,683 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 21:02:50,684 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-02 21:02:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 21:02:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 21:02:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 21:02:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-02 21:02:50,689 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-02 21:02:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:50,690 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-02 21:02:50,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:02:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-02 21:02:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 21:02:50,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:50,690 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:50,691 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-02 21:02:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-02 21:02:50,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:50,691 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:50,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,692 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:50,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:50,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:50,758 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-02 21:02:50,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:02:50,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 21:02:50,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:02:50,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:02:50,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:02:50,760 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-02 21:02:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:50,788 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-02 21:02:50,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:02:50,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 21:02:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:50,789 INFO L225 Difference]: With dead ends: 132 [2018-02-02 21:02:50,790 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 21:02:50,790 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-02 21:02:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 21:02:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-02 21:02:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 21:02:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-02 21:02:50,803 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-02 21:02:50,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:50,803 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-02 21:02:50,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:02:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-02 21:02:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 21:02:50,803 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:50,804 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:50,804 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-02 21:02:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-02 21:02:50,804 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:50,804 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:50,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,805 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:50,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:50,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:50,849 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-02 21:02:50,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:02:50,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:02:50,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:02:50,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:02:50,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:02:50,850 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-02 21:02:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:50,919 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-02 21:02:50,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:02:50,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-02 21:02:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:50,921 INFO L225 Difference]: With dead ends: 147 [2018-02-02 21:02:50,921 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 21:02:50,922 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-02 21:02:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 21:02:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-02 21:02:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 21:02:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-02 21:02:50,933 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-02 21:02:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:50,934 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-02 21:02:50,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:02:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-02 21:02:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 21:02:50,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:50,935 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:50,935 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-02 21:02:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-02 21:02:50,935 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:50,935 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:50,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,936 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:50,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:50,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:50,994 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-02 21:02:50,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:02:50,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:02:50,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:02:50,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:02:50,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:02:50,995 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-02 21:02:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:51,054 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-02 21:02:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:02:51,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 21:02:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:51,056 INFO L225 Difference]: With dead ends: 255 [2018-02-02 21:02:51,056 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 21:02:51,057 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-02 21:02:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 21:02:51,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-02 21:02:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 21:02:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-02 21:02:51,072 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-02 21:02:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:51,072 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-02 21:02:51,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:02:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-02 21:02:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 21:02:51,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:51,073 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:51,073 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-02 21:02:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-02 21:02:51,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:51,074 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:51,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,075 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:51,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:51,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:51,106 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-02 21:02:51,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:02:51,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 21:02:51,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:02:51,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:02:51,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:02:51,107 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-02 21:02:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:51,191 INFO L93 Difference]: Finished difference Result 388 states and 570 transitions. [2018-02-02 21:02:51,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:02:51,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 21:02:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:51,195 INFO L225 Difference]: With dead ends: 388 [2018-02-02 21:02:51,195 INFO L226 Difference]: Without dead ends: 388 [2018-02-02 21:02:51,196 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-02 21:02:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-02 21:02:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-02-02 21:02:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 21:02:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-02 21:02:51,219 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-02 21:02:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:51,219 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-02 21:02:51,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:02:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-02 21:02:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 21:02:51,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:51,220 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:51,220 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-02 21:02:51,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-02 21:02:51,221 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:51,221 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:51,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,222 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:51,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:51,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:51,273 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-02 21:02:51,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:02:51,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 21:02:51,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:02:51,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:02:51,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:02:51,274 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-02 21:02:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:51,358 INFO L93 Difference]: Finished difference Result 487 states and 717 transitions. [2018-02-02 21:02:51,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:02:51,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 21:02:51,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:51,362 INFO L225 Difference]: With dead ends: 487 [2018-02-02 21:02:51,362 INFO L226 Difference]: Without dead ends: 487 [2018-02-02 21:02:51,363 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-02 21:02:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-02-02 21:02:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2018-02-02 21:02:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-02 21:02:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-02 21:02:51,378 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-02 21:02:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:51,378 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-02 21:02:51,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:02:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-02 21:02:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 21:02:51,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:51,379 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:02:51,379 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-02 21:02:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-02 21:02:51,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:51,380 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:51,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,387 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:51,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:51,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:51,429 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-02 21:02:51,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:02:51,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:02:51,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:02:51,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:02:51,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:02:51,430 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-02 21:02:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:51,476 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-02 21:02:51,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:02:51,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 21:02:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:51,480 INFO L225 Difference]: With dead ends: 861 [2018-02-02 21:02:51,481 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 21:02:51,481 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-02 21:02:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 21:02:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-02 21:02:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-02 21:02:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-02 21:02:51,507 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-02 21:02:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:51,507 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-02 21:02:51,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:02:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-02 21:02:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 21:02:51,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:51,508 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-02 21:02:51,509 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-02 21:02:51,509 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-02 21:02:51,509 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:51,509 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:51,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,510 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:51,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:51,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:51,563 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-02 21:02:51,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:51,563 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:51,564 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:51,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:51,651 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-02 21:02:51,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:51,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-02 21:02:51,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:02:51,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:02:51,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:02:51,652 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-02 21:02:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:51,743 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-02 21:02:51,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:02:51,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 21:02:51,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:51,750 INFO L225 Difference]: With dead ends: 1289 [2018-02-02 21:02:51,751 INFO L226 Difference]: Without dead ends: 1289 [2018-02-02 21:02:51,751 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-02 21:02:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-02 21:02:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-02 21:02:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-02 21:02:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-02 21:02:51,784 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-02 21:02:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:51,784 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-02 21:02:51,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:02:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-02 21:02:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 21:02:51,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:51,785 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-02 21:02:51,786 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-02 21:02:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-02 21:02:51,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:51,786 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:51,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,787 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:51,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:51,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:51,881 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-02 21:02:51,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:51,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:51,882 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:51,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:51,946 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-02 21:02:51,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:02:51,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-02-02 21:02:51,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:02:51,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:02:51,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:02:51,947 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 12 states. [2018-02-02 21:02:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:53,162 INFO L93 Difference]: Finished difference Result 5413 states and 8632 transitions. [2018-02-02 21:02:53,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 21:02:53,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-02 21:02:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:53,192 INFO L225 Difference]: With dead ends: 5413 [2018-02-02 21:02:53,192 INFO L226 Difference]: Without dead ends: 5413 [2018-02-02 21:02:53,194 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-02 21:02:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5413 states. [2018-02-02 21:02:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5413 to 4436. [2018-02-02 21:02:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4436 states. [2018-02-02 21:02:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 6634 transitions. [2018-02-02 21:02:53,326 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 6634 transitions. Word has length 27 [2018-02-02 21:02:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:53,326 INFO L432 AbstractCegarLoop]: Abstraction has 4436 states and 6634 transitions. [2018-02-02 21:02:53,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:02:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 6634 transitions. [2018-02-02 21:02:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 21:02:53,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:53,327 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-02 21:02:53,328 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-02 21:02:53,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-02 21:02:53,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:53,328 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:53,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:53,329 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:53,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:53,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:53,400 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-02 21:02:53,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:02:53,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:02:53,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:02:53,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:02:53,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:02:53,401 INFO L87 Difference]: Start difference. First operand 4436 states and 6634 transitions. Second operand 7 states. [2018-02-02 21:02:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:53,556 INFO L93 Difference]: Finished difference Result 2014 states and 2540 transitions. [2018-02-02 21:02:53,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:02:53,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-02 21:02:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:53,564 INFO L225 Difference]: With dead ends: 2014 [2018-02-02 21:02:53,564 INFO L226 Difference]: Without dead ends: 1582 [2018-02-02 21:02:53,564 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-02 21:02:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-02-02 21:02:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1447. [2018-02-02 21:02:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-02-02 21:02:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1933 transitions. [2018-02-02 21:02:53,621 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1933 transitions. Word has length 31 [2018-02-02 21:02:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:53,622 INFO L432 AbstractCegarLoop]: Abstraction has 1447 states and 1933 transitions. [2018-02-02 21:02:53,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:02:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1933 transitions. [2018-02-02 21:02:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 21:02:53,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:53,623 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-02 21:02:53,623 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-02 21:02:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-02 21:02:53,624 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:53,624 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:53,625 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:53,625 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:53,625 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:53,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:53,746 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-02 21:02:53,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:53,747 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:53,747 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:53,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:53,820 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-02 21:02:53,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:02:53,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-02-02 21:02:53,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 21:02:53,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 21:02:53,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 21:02:53,821 INFO L87 Difference]: Start difference. First operand 1447 states and 1933 transitions. Second operand 12 states. [2018-02-02 21:02:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:54,390 INFO L93 Difference]: Finished difference Result 2624 states and 3481 transitions. [2018-02-02 21:02:54,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 21:02:54,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-02 21:02:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:54,400 INFO L225 Difference]: With dead ends: 2624 [2018-02-02 21:02:54,400 INFO L226 Difference]: Without dead ends: 2612 [2018-02-02 21:02:54,400 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-02 21:02:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2018-02-02 21:02:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2012. [2018-02-02 21:02:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2018-02-02 21:02:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2686 transitions. [2018-02-02 21:02:54,450 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2686 transitions. Word has length 31 [2018-02-02 21:02:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:54,450 INFO L432 AbstractCegarLoop]: Abstraction has 2012 states and 2686 transitions. [2018-02-02 21:02:54,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 21:02:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2686 transitions. [2018-02-02 21:02:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 21:02:54,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:54,452 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-02 21:02:54,452 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-02 21:02:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-02 21:02:54,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:54,452 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:54,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:54,453 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:54,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:54,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:54,545 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-02 21:02:54,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:54,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:54,546 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:54,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:54,607 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-02 21:02:54,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:02:54,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-02 21:02:54,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 21:02:54,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 21:02:54,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:02:54,608 INFO L87 Difference]: Start difference. First operand 2012 states and 2686 transitions. Second operand 10 states. [2018-02-02 21:02:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:55,113 INFO L93 Difference]: Finished difference Result 2227 states and 2898 transitions. [2018-02-02 21:02:55,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 21:02:55,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-02 21:02:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:55,121 INFO L225 Difference]: With dead ends: 2227 [2018-02-02 21:02:55,122 INFO L226 Difference]: Without dead ends: 2227 [2018-02-02 21:02:55,122 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-02 21:02:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-02-02 21:02:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1960. [2018-02-02 21:02:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2018-02-02 21:02:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2578 transitions. [2018-02-02 21:02:55,160 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2578 transitions. Word has length 38 [2018-02-02 21:02:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:55,161 INFO L432 AbstractCegarLoop]: Abstraction has 1960 states and 2578 transitions. [2018-02-02 21:02:55,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 21:02:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2578 transitions. [2018-02-02 21:02:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:02:55,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:55,162 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-02 21:02:55,162 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-02 21:02:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-02 21:02:55,162 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:55,163 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:55,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:55,163 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:55,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:55,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:55,255 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-02 21:02:55,256 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:55,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:55,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:55,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:55,313 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-02 21:02:55,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:55,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-02-02 21:02:55,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 21:02:55,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 21:02:55,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:02:55,314 INFO L87 Difference]: Start difference. First operand 1960 states and 2578 transitions. Second operand 14 states. [2018-02-02 21:02:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:55,894 INFO L93 Difference]: Finished difference Result 4076 states and 5859 transitions. [2018-02-02 21:02:55,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 21:02:55,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-02 21:02:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:55,909 INFO L225 Difference]: With dead ends: 4076 [2018-02-02 21:02:55,909 INFO L226 Difference]: Without dead ends: 4076 [2018-02-02 21:02:55,910 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-02 21:02:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2018-02-02 21:02:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 2516. [2018-02-02 21:02:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2018-02-02 21:02:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 3350 transitions. [2018-02-02 21:02:55,978 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 3350 transitions. Word has length 42 [2018-02-02 21:02:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:55,978 INFO L432 AbstractCegarLoop]: Abstraction has 2516 states and 3350 transitions. [2018-02-02 21:02:55,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 21:02:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 3350 transitions. [2018-02-02 21:02:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 21:02:55,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:55,979 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-02 21:02:55,979 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-02 21:02:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1922656245, now seen corresponding path program 1 times [2018-02-02 21:02:55,979 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:55,980 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:55,980 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:55,980 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:55,980 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:55,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:56,079 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-02 21:02:56,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:56,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:56,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:56,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:56,182 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-02 21:02:56,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:56,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-02-02 21:02:56,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:02:56,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:02:56,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:02:56,184 INFO L87 Difference]: Start difference. First operand 2516 states and 3350 transitions. Second operand 13 states. [2018-02-02 21:02:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:57,051 INFO L93 Difference]: Finished difference Result 1714 states and 2239 transitions. [2018-02-02 21:02:57,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 21:02:57,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 21:02:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:57,056 INFO L225 Difference]: With dead ends: 1714 [2018-02-02 21:02:57,057 INFO L226 Difference]: Without dead ends: 1654 [2018-02-02 21:02:57,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:02:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2018-02-02 21:02:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1484. [2018-02-02 21:02:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-02-02 21:02:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1960 transitions. [2018-02-02 21:02:57,085 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1960 transitions. Word has length 43 [2018-02-02 21:02:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:57,086 INFO L432 AbstractCegarLoop]: Abstraction has 1484 states and 1960 transitions. [2018-02-02 21:02:57,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:02:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1960 transitions. [2018-02-02 21:02:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 21:02:57,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:57,090 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-02 21:02:57,090 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-02 21:02:57,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-02 21:02:57,090 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:57,090 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:57,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:57,091 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:57,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:57,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:57,171 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-02 21:02:57,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:57,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:57,172 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:57,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:57,237 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-02 21:02:57,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:57,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 21:02:57,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:02:57,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:02:57,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:02:57,238 INFO L87 Difference]: Start difference. First operand 1484 states and 1960 transitions. Second operand 11 states. [2018-02-02 21:02:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:57,418 INFO L93 Difference]: Finished difference Result 1951 states and 2669 transitions. [2018-02-02 21:02:57,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:02:57,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 21:02:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:57,425 INFO L225 Difference]: With dead ends: 1951 [2018-02-02 21:02:57,425 INFO L226 Difference]: Without dead ends: 1951 [2018-02-02 21:02:57,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:02:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-02-02 21:02:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1524. [2018-02-02 21:02:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2018-02-02 21:02:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2020 transitions. [2018-02-02 21:02:57,458 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2020 transitions. Word has length 54 [2018-02-02 21:02:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:57,458 INFO L432 AbstractCegarLoop]: Abstraction has 1524 states and 2020 transitions. [2018-02-02 21:02:57,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:02:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2020 transitions. [2018-02-02 21:02:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 21:02:57,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:57,460 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-02 21:02:57,460 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-02 21:02:57,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-02 21:02:57,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:57,460 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:57,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:57,461 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:57,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:57,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:57,532 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-02 21:02:57,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:57,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:57,533 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:57,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:57,716 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-02 21:02:57,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:57,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-02 21:02:57,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 21:02:57,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 21:02:57,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:02:57,717 INFO L87 Difference]: Start difference. First operand 1524 states and 2020 transitions. Second operand 15 states. [2018-02-02 21:02:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:58,210 INFO L93 Difference]: Finished difference Result 2564 states and 3550 transitions. [2018-02-02 21:02:58,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 21:02:58,211 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-02 21:02:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:58,217 INFO L225 Difference]: With dead ends: 2564 [2018-02-02 21:02:58,217 INFO L226 Difference]: Without dead ends: 2514 [2018-02-02 21:02:58,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 21:02:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2018-02-02 21:02:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2081. [2018-02-02 21:02:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-02-02 21:02:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2776 transitions. [2018-02-02 21:02:58,280 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2776 transitions. Word has length 54 [2018-02-02 21:02:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:58,280 INFO L432 AbstractCegarLoop]: Abstraction has 2081 states and 2776 transitions. [2018-02-02 21:02:58,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 21:02:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2776 transitions. [2018-02-02 21:02:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 21:02:58,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:58,282 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-02 21:02:58,282 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-02 21:02:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-02 21:02:58,282 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:58,282 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:58,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:58,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:58,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:58,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:58,376 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-02 21:02:58,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:58,376 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:58,377 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:58,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:58,446 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-02 21:02:58,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:58,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 21:02:58,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:02:58,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:02:58,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:02:58,447 INFO L87 Difference]: Start difference. First operand 2081 states and 2776 transitions. Second operand 11 states. [2018-02-02 21:02:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:58,700 INFO L93 Difference]: Finished difference Result 2508 states and 3400 transitions. [2018-02-02 21:02:58,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:02:58,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-02 21:02:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:58,713 INFO L225 Difference]: With dead ends: 2508 [2018-02-02 21:02:58,714 INFO L226 Difference]: Without dead ends: 2508 [2018-02-02 21:02:58,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:02:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2018-02-02 21:02:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2478. [2018-02-02 21:02:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2478 states. [2018-02-02 21:02:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3372 transitions. [2018-02-02 21:02:58,771 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3372 transitions. Word has length 68 [2018-02-02 21:02:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:58,771 INFO L432 AbstractCegarLoop]: Abstraction has 2478 states and 3372 transitions. [2018-02-02 21:02:58,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:02:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3372 transitions. [2018-02-02 21:02:58,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 21:02:58,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:58,773 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-02 21:02:58,773 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-02 21:02:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-02 21:02:58,774 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:58,774 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:58,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:58,775 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:58,775 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:58,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:02:58,902 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-02 21:02:58,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:02:58,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:02:58,902 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:58,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:02:59,005 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-02 21:02:59,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:02:59,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-02 21:02:59,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:02:59,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:02:59,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:02:59,006 INFO L87 Difference]: Start difference. First operand 2478 states and 3372 transitions. Second operand 18 states. [2018-02-02 21:02:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:02:59,897 INFO L93 Difference]: Finished difference Result 4340 states and 6003 transitions. [2018-02-02 21:02:59,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 21:02:59,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-02 21:02:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:02:59,910 INFO L225 Difference]: With dead ends: 4340 [2018-02-02 21:02:59,910 INFO L226 Difference]: Without dead ends: 4280 [2018-02-02 21:02:59,910 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-02 21:02:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2018-02-02 21:02:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 3187. [2018-02-02 21:02:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3187 states. [2018-02-02 21:02:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 4260 transitions. [2018-02-02 21:02:59,965 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 4260 transitions. Word has length 70 [2018-02-02 21:02:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:02:59,965 INFO L432 AbstractCegarLoop]: Abstraction has 3187 states and 4260 transitions. [2018-02-02 21:02:59,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:02:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 4260 transitions. [2018-02-02 21:02:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 21:02:59,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:02:59,967 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-02 21:02:59,967 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-02 21:02:59,967 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-02 21:02:59,967 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:02:59,967 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:02:59,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:59,968 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:02:59,968 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:02:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:02:59,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:00,108 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-02 21:03:00,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:00,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:00,109 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:00,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:00,224 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-02 21:03:00,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:00,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-02 21:03:00,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:03:00,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:03:00,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:03:00,225 INFO L87 Difference]: Start difference. First operand 3187 states and 4260 transitions. Second operand 17 states. [2018-02-02 21:03:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:00,844 INFO L93 Difference]: Finished difference Result 4197 states and 5723 transitions. [2018-02-02 21:03:00,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 21:03:00,844 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-02 21:03:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:00,852 INFO L225 Difference]: With dead ends: 4197 [2018-02-02 21:03:00,852 INFO L226 Difference]: Without dead ends: 4107 [2018-02-02 21:03:00,852 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-02 21:03:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-02-02 21:03:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3010. [2018-02-02 21:03:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3010 states. [2018-02-02 21:03:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 3973 transitions. [2018-02-02 21:03:00,910 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 3973 transitions. Word has length 84 [2018-02-02 21:03:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:00,911 INFO L432 AbstractCegarLoop]: Abstraction has 3010 states and 3973 transitions. [2018-02-02 21:03:00,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:03:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 3973 transitions. [2018-02-02 21:03:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 21:03:00,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:00,912 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-02 21:03:00,912 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-02 21:03:00,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-02 21:03:00,912 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:00,912 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:00,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:00,913 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:00,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:00,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:00,995 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-02 21:03:00,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:00,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:00,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:01,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:01,121 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-02 21:03:01,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:01,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-02-02 21:03:01,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:03:01,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:03:01,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:03:01,122 INFO L87 Difference]: Start difference. First operand 3010 states and 3973 transitions. Second operand 17 states. [2018-02-02 21:03:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:02,732 INFO L93 Difference]: Finished difference Result 6632 states and 8888 transitions. [2018-02-02 21:03:02,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-02 21:03:02,733 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-02-02 21:03:02,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:02,751 INFO L225 Difference]: With dead ends: 6632 [2018-02-02 21:03:02,751 INFO L226 Difference]: Without dead ends: 6570 [2018-02-02 21:03:02,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1105, Invalid=5537, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 21:03:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6570 states. [2018-02-02 21:03:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6570 to 5654. [2018-02-02 21:03:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5654 states. [2018-02-02 21:03:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5654 states to 5654 states and 7604 transitions. [2018-02-02 21:03:02,839 INFO L78 Accepts]: Start accepts. Automaton has 5654 states and 7604 transitions. Word has length 87 [2018-02-02 21:03:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:02,839 INFO L432 AbstractCegarLoop]: Abstraction has 5654 states and 7604 transitions. [2018-02-02 21:03:02,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:03:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5654 states and 7604 transitions. [2018-02-02 21:03:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 21:03:02,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:02,840 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-02 21:03:02,840 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-02 21:03:02,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-02-02 21:03:02,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:02,840 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:02,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:02,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:02,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:02,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:02,987 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-02 21:03:02,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:02,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:02,987 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:03,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:03,200 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-02 21:03:03,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:03,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-02 21:03:03,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:03:03,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:03:03,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:03:03,201 INFO L87 Difference]: Start difference. First operand 5654 states and 7604 transitions. Second operand 18 states. [2018-02-02 21:03:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:06,188 INFO L93 Difference]: Finished difference Result 12914 states and 17927 transitions. [2018-02-02 21:03:06,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-02 21:03:06,188 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-02-02 21:03:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:06,214 INFO L225 Difference]: With dead ends: 12914 [2018-02-02 21:03:06,214 INFO L226 Difference]: Without dead ends: 12914 [2018-02-02 21:03:06,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3820 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1614, Invalid=9942, Unknown=0, NotChecked=0, Total=11556 [2018-02-02 21:03:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12914 states. [2018-02-02 21:03:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12914 to 9873. [2018-02-02 21:03:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9873 states. [2018-02-02 21:03:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 13624 transitions. [2018-02-02 21:03:06,395 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 13624 transitions. Word has length 99 [2018-02-02 21:03:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:06,395 INFO L432 AbstractCegarLoop]: Abstraction has 9873 states and 13624 transitions. [2018-02-02 21:03:06,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:03:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 13624 transitions. [2018-02-02 21:03:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 21:03:06,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:06,397 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-02 21:03:06,397 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-02 21:03:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1793769950, now seen corresponding path program 1 times [2018-02-02 21:03:06,397 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:06,398 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:06,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:06,398 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:06,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:06,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:06,590 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-02 21:03:06,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:06,591 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:06,591 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:06,636 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:06,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02 21:03:06,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:03:06,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:03:06,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:03:06,863 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-02 21:03:06,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:06,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-02-02 21:03:06,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 21:03:06,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 21:03:06,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-02 21:03:06,865 INFO L87 Difference]: Start difference. First operand 9873 states and 13624 transitions. Second operand 22 states. [2018-02-02 21:03:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:08,467 INFO L93 Difference]: Finished difference Result 13801 states and 18950 transitions. [2018-02-02 21:03:08,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 21:03:08,467 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 105 [2018-02-02 21:03:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:08,493 INFO L225 Difference]: With dead ends: 13801 [2018-02-02 21:03:08,493 INFO L226 Difference]: Without dead ends: 13801 [2018-02-02 21:03:08,493 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-02 21:03:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13801 states. [2018-02-02 21:03:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13801 to 13007. [2018-02-02 21:03:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13007 states. [2018-02-02 21:03:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 17908 transitions. [2018-02-02 21:03:08,635 INFO L78 Accepts]: Start accepts. Automaton has 13007 states and 17908 transitions. Word has length 105 [2018-02-02 21:03:08,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:08,635 INFO L432 AbstractCegarLoop]: Abstraction has 13007 states and 17908 transitions. [2018-02-02 21:03:08,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 21:03:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 13007 states and 17908 transitions. [2018-02-02 21:03:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-02 21:03:08,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:08,639 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-02 21:03:08,639 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-02 21:03:08,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1854918738, now seen corresponding path program 1 times [2018-02-02 21:03:08,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:08,639 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:08,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:08,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:08,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:08,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:08,773 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-02 21:03:08,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:03:08,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:03:08,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:03:08,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:03:08,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:03:08,774 INFO L87 Difference]: Start difference. First operand 13007 states and 17908 transitions. Second operand 6 states. [2018-02-02 21:03:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:08,888 INFO L93 Difference]: Finished difference Result 20824 states and 29399 transitions. [2018-02-02 21:03:08,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:03:08,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-02-02 21:03:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:08,948 INFO L225 Difference]: With dead ends: 20824 [2018-02-02 21:03:08,948 INFO L226 Difference]: Without dead ends: 20824 [2018-02-02 21:03:08,948 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-02 21:03:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20824 states. [2018-02-02 21:03:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20824 to 20821. [2018-02-02 21:03:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20821 states. [2018-02-02 21:03:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20821 states to 20821 states and 29398 transitions. [2018-02-02 21:03:09,238 INFO L78 Accepts]: Start accepts. Automaton has 20821 states and 29398 transitions. Word has length 131 [2018-02-02 21:03:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:09,239 INFO L432 AbstractCegarLoop]: Abstraction has 20821 states and 29398 transitions. [2018-02-02 21:03:09,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:03:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20821 states and 29398 transitions. [2018-02-02 21:03:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-02 21:03:09,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:09,245 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-02 21:03:09,245 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-02 21:03:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash 970215073, now seen corresponding path program 1 times [2018-02-02 21:03:09,246 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:09,246 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:09,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:09,246 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:09,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:09,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:09,417 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-02 21:03:09,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:09,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:09,417 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:09,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:09,566 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-02 21:03:09,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:09,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-02-02 21:03:09,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:03:09,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:03:09,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:03:09,568 INFO L87 Difference]: Start difference. First operand 20821 states and 29398 transitions. Second operand 18 states. [2018-02-02 21:03:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:13,263 INFO L93 Difference]: Finished difference Result 37614 states and 50785 transitions. [2018-02-02 21:03:13,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-02-02 21:03:13,263 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2018-02-02 21:03:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:13,320 INFO L225 Difference]: With dead ends: 37614 [2018-02-02 21:03:13,321 INFO L226 Difference]: Without dead ends: 36494 [2018-02-02 21:03:13,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7113 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2448, Invalid=16184, Unknown=0, NotChecked=0, Total=18632 [2018-02-02 21:03:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36494 states. [2018-02-02 21:03:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36494 to 33304. [2018-02-02 21:03:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33304 states. [2018-02-02 21:03:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33304 states to 33304 states and 45104 transitions. [2018-02-02 21:03:13,873 INFO L78 Accepts]: Start accepts. Automaton has 33304 states and 45104 transitions. Word has length 141 [2018-02-02 21:03:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:13,873 INFO L432 AbstractCegarLoop]: Abstraction has 33304 states and 45104 transitions. [2018-02-02 21:03:13,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:03:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 33304 states and 45104 transitions. [2018-02-02 21:03:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-02 21:03:13,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:13,880 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-02 21:03:13,880 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-02 21:03:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1022004672, now seen corresponding path program 1 times [2018-02-02 21:03:13,880 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:13,880 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:13,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:13,881 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:13,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:13,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:13,998 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-02 21:03:13,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:13,998 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:13,999 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:14,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:14,097 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-02 21:03:14,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:14,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 14 [2018-02-02 21:03:14,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 21:03:14,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 21:03:14,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:03:14,099 INFO L87 Difference]: Start difference. First operand 33304 states and 45104 transitions. Second operand 14 states. [2018-02-02 21:03:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:14,748 INFO L93 Difference]: Finished difference Result 25254 states and 33812 transitions. [2018-02-02 21:03:14,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 21:03:14,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-02-02 21:03:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:14,783 INFO L225 Difference]: With dead ends: 25254 [2018-02-02 21:03:14,784 INFO L226 Difference]: Without dead ends: 24038 [2018-02-02 21:03:14,784 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-02 21:03:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24038 states. [2018-02-02 21:03:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24038 to 20882. [2018-02-02 21:03:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20882 states. [2018-02-02 21:03:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20882 states to 20882 states and 27282 transitions. [2018-02-02 21:03:15,029 INFO L78 Accepts]: Start accepts. Automaton has 20882 states and 27282 transitions. Word has length 155 [2018-02-02 21:03:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:15,030 INFO L432 AbstractCegarLoop]: Abstraction has 20882 states and 27282 transitions. [2018-02-02 21:03:15,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 21:03:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 20882 states and 27282 transitions. [2018-02-02 21:03:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-02 21:03:15,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:15,037 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-02 21:03:15,037 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-02 21:03:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash 61686075, now seen corresponding path program 1 times [2018-02-02 21:03:15,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:15,037 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:15,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:15,038 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:15,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:15,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:15,125 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-02 21:03:15,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:15,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:15,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:15,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:15,235 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-02 21:03:15,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:15,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 21:03:15,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:03:15,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:03:15,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:03:15,236 INFO L87 Difference]: Start difference. First operand 20882 states and 27282 transitions. Second operand 11 states. [2018-02-02 21:03:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:15,582 INFO L93 Difference]: Finished difference Result 14464 states and 18778 transitions. [2018-02-02 21:03:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 21:03:15,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2018-02-02 21:03:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:15,604 INFO L225 Difference]: With dead ends: 14464 [2018-02-02 21:03:15,604 INFO L226 Difference]: Without dead ends: 11544 [2018-02-02 21:03:15,604 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-02 21:03:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11544 states. [2018-02-02 21:03:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11544 to 9994. [2018-02-02 21:03:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9994 states. [2018-02-02 21:03:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9994 states to 9994 states and 12808 transitions. [2018-02-02 21:03:15,707 INFO L78 Accepts]: Start accepts. Automaton has 9994 states and 12808 transitions. Word has length 159 [2018-02-02 21:03:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:15,707 INFO L432 AbstractCegarLoop]: Abstraction has 9994 states and 12808 transitions. [2018-02-02 21:03:15,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:03:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9994 states and 12808 transitions. [2018-02-02 21:03:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 21:03:15,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:15,714 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-02 21:03:15,715 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-02 21:03:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash 50496070, now seen corresponding path program 1 times [2018-02-02 21:03:15,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:15,715 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:15,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:15,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:15,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:15,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:15,811 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-02 21:03:15,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:15,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:15,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:15,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:15,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 21:03:15,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:03:15,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:03:15,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 21:03:16,092 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-02 21:03:16,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:16,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 15 [2018-02-02 21:03:16,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 21:03:16,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 21:03:16,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 21:03:16,094 INFO L87 Difference]: Start difference. First operand 9994 states and 12808 transitions. Second operand 16 states. [2018-02-02 21:03:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:17,741 INFO L93 Difference]: Finished difference Result 11729 states and 14964 transitions. [2018-02-02 21:03:17,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 21:03:17,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 162 [2018-02-02 21:03:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:17,766 INFO L225 Difference]: With dead ends: 11729 [2018-02-02 21:03:17,766 INFO L226 Difference]: Without dead ends: 11729 [2018-02-02 21:03:17,767 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-02 21:03:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11729 states. [2018-02-02 21:03:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11729 to 9996. [2018-02-02 21:03:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9996 states. [2018-02-02 21:03:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9996 states to 9996 states and 12812 transitions. [2018-02-02 21:03:17,934 INFO L78 Accepts]: Start accepts. Automaton has 9996 states and 12812 transitions. Word has length 162 [2018-02-02 21:03:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:17,934 INFO L432 AbstractCegarLoop]: Abstraction has 9996 states and 12812 transitions. [2018-02-02 21:03:17,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 21:03:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 9996 states and 12812 transitions. [2018-02-02 21:03:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 21:03:17,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:17,938 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-02 21:03:17,938 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-02 21:03:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 50496071, now seen corresponding path program 1 times [2018-02-02 21:03:17,939 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:17,939 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:17,939 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:17,939 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:17,939 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:17,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:18,156 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-02 21:03:18,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:18,156 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:18,157 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:18,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:18,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02 21:03:18,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:03:18,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:03:18,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:03:18,675 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-02 21:03:18,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:18,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2018-02-02 21:03:18,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 21:03:18,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 21:03:18,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:03:18,677 INFO L87 Difference]: Start difference. First operand 9996 states and 12812 transitions. Second operand 27 states. [2018-02-02 21:03:20,169 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 63 DAG size of output 38 [2018-02-02 21:03:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:24,029 INFO L93 Difference]: Finished difference Result 18890 states and 24800 transitions. [2018-02-02 21:03:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-02-02 21:03:24,029 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 162 [2018-02-02 21:03:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:24,065 INFO L225 Difference]: With dead ends: 18890 [2018-02-02 21:03:24,065 INFO L226 Difference]: Without dead ends: 18890 [2018-02-02 21:03:24,066 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-02 21:03:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18890 states. [2018-02-02 21:03:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18890 to 14296. [2018-02-02 21:03:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14296 states. [2018-02-02 21:03:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14296 states to 14296 states and 18540 transitions. [2018-02-02 21:03:24,213 INFO L78 Accepts]: Start accepts. Automaton has 14296 states and 18540 transitions. Word has length 162 [2018-02-02 21:03:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:24,213 INFO L432 AbstractCegarLoop]: Abstraction has 14296 states and 18540 transitions. [2018-02-02 21:03:24,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 21:03:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 14296 states and 18540 transitions. [2018-02-02 21:03:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-02 21:03:24,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:24,218 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-02 21:03:24,218 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-02 21:03:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1565376607, now seen corresponding path program 1 times [2018-02-02 21:03:24,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:24,218 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:24,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:24,218 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:24,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:24,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:24,382 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-02 21:03:24,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:24,382 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:24,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:24,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:24,527 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-02 21:03:24,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:24,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2018-02-02 21:03:24,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:03:24,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:03:24,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:03:24,528 INFO L87 Difference]: Start difference. First operand 14296 states and 18540 transitions. Second operand 18 states. [2018-02-02 21:03:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:27,957 INFO L93 Difference]: Finished difference Result 17506 states and 22279 transitions. [2018-02-02 21:03:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-02-02 21:03:27,958 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 163 [2018-02-02 21:03:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:27,994 INFO L225 Difference]: With dead ends: 17506 [2018-02-02 21:03:27,994 INFO L226 Difference]: Without dead ends: 17506 [2018-02-02 21:03:27,996 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-02 21:03:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17506 states. [2018-02-02 21:03:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17506 to 13944. [2018-02-02 21:03:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13944 states. [2018-02-02 21:03:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13944 states to 13944 states and 17850 transitions. [2018-02-02 21:03:28,153 INFO L78 Accepts]: Start accepts. Automaton has 13944 states and 17850 transitions. Word has length 163 [2018-02-02 21:03:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:28,154 INFO L432 AbstractCegarLoop]: Abstraction has 13944 states and 17850 transitions. [2018-02-02 21:03:28,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:03:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 13944 states and 17850 transitions. [2018-02-02 21:03:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-02 21:03:28,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:28,159 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-02 21:03:28,159 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-02 21:03:28,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1434737638, now seen corresponding path program 1 times [2018-02-02 21:03:28,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:28,159 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:28,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:28,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:28,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:28,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:28,783 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-02 21:03:28,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:03:28,784 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:03:28,784 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:28,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:03:29,009 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-02 21:03:29,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02 21:03:29,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:03:29,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:03:29,020 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-02 21:03:29,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02 21:03:29,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 21:03:29,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:03:29,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:03:29,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-02-02 21:03:29,137 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-02 21:03:29,147 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-02 21:03:29,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 21:03:29,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:03:29,157 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-02 21:03:29,161 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-02 21:03:29,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 21:03:29,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:03:29,170 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-02 21:03:29,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:18 [2018-02-02 21:03:29,241 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-02 21:03:29,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:03:29,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 34 [2018-02-02 21:03:29,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 21:03:29,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 21:03:29,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 21:03:29,243 INFO L87 Difference]: Start difference. First operand 13944 states and 17850 transitions. Second operand 34 states. [2018-02-02 21:03:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:03:33,113 INFO L93 Difference]: Finished difference Result 22982 states and 30095 transitions. [2018-02-02 21:03:33,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-02 21:03:33,113 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 168 [2018-02-02 21:03:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:03:33,146 INFO L225 Difference]: With dead ends: 22982 [2018-02-02 21:03:33,146 INFO L226 Difference]: Without dead ends: 22922 [2018-02-02 21:03:33,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 165 SyntacticMatches, 13 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3024 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1455, Invalid=9051, Unknown=0, NotChecked=0, Total=10506 [2018-02-02 21:03:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22922 states. [2018-02-02 21:03:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22922 to 20866. [2018-02-02 21:03:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20866 states. [2018-02-02 21:03:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20866 states to 20866 states and 26742 transitions. [2018-02-02 21:03:33,344 INFO L78 Accepts]: Start accepts. Automaton has 20866 states and 26742 transitions. Word has length 168 [2018-02-02 21:03:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:03:33,344 INFO L432 AbstractCegarLoop]: Abstraction has 20866 states and 26742 transitions. [2018-02-02 21:03:33,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 21:03:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 20866 states and 26742 transitions. [2018-02-02 21:03:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-02 21:03:33,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:03:33,349 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-02 21:03:33,349 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-02 21:03:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1527195381, now seen corresponding path program 1 times [2018-02-02 21:03:33,349 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:03:33,349 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:03:33,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:33,350 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:03:33,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:03:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:03:33,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:03:33,377 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 21:03:33,380 INFO L168 Benchmark]: Toolchain (without parser) took 43541.14 ms. Allocated memory was 395.8 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 352.5 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 513.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:03:33,381 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 395.8 MB. Free memory is still 357.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:03:33,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.55 ms. Allocated memory is still 395.8 MB. Free memory was 352.5 MB in the beginning and 342.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:03:33,382 INFO L168 Benchmark]: Boogie Preprocessor took 33.55 ms. Allocated memory is still 395.8 MB. Free memory was 342.0 MB in the beginning and 339.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:03:33,382 INFO L168 Benchmark]: RCFGBuilder took 253.09 ms. Allocated memory is still 395.8 MB. Free memory was 339.3 MB in the beginning and 311.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-02 21:03:33,382 INFO L168 Benchmark]: TraceAbstraction took 43099.91 ms. Allocated memory was 395.8 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 311.6 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 472.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:03:33,383 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.13 ms. Allocated memory is still 395.8 MB. Free memory is still 357.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.55 ms. Allocated memory is still 395.8 MB. Free memory was 352.5 MB in the beginning and 342.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.55 ms. Allocated memory is still 395.8 MB. Free memory was 342.0 MB in the beginning and 339.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 253.09 ms. Allocated memory is still 395.8 MB. Free memory was 339.3 MB in the beginning and 311.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43099.91 ms. Allocated memory was 395.8 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 311.6 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 472.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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-02_21-03-33-389.csv Received shutdown request...