java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:07:03,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:07:03,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:07:03,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:07:03,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:07:03,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:07:03,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:07:03,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:07:03,486 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:07:03,487 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:07:03,487 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:07:03,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:07:03,488 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:07:03,489 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:07:03,490 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:07:03,492 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:07:03,493 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:07:03,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:07:03,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:07:03,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:07:03,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:07:03,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:07:03,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:07:03,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:07:03,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:07:03,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:07:03,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:07:03,502 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:07:03,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:07:03,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:07:03,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:07:03,503 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:07:03,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:07:03,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:07:03,514 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:07:03,514 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:07:03,514 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:07:03,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:07:03,515 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:07:03,515 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:07:03,515 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:07:03,515 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:07:03,515 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:07:03,515 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:07:03,516 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:07:03,516 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:07:03,516 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:07:03,516 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:07:03,516 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:07:03,517 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:07:03,517 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:07:03,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:07:03,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:07:03,517 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:07:03,517 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:07:03,517 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:07:03,518 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:07:03,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:07:03,557 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:07:03,561 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:07:03,562 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:07:03,562 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:07:03,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-02-04 04:07:03,664 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:07:03,665 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:07:03,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:07:03,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:07:03,672 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:07:03,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:07:03" (1/1) ... [2018-02-04 04:07:03,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fc9421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03, skipping insertion in model container [2018-02-04 04:07:03,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:07:03" (1/1) ... [2018-02-04 04:07:03,691 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:07:03,704 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:07:03,793 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:07:03,801 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:07:03,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03 WrapperNode [2018-02-04 04:07:03,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:07:03,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:07:03,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:07:03,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:07:03,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03" (1/1) ... [2018-02-04 04:07:03,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03" (1/1) ... [2018-02-04 04:07:03,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03" (1/1) ... [2018-02-04 04:07:03,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03" (1/1) ... [2018-02-04 04:07:03,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03" (1/1) ... [2018-02-04 04:07:03,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03" (1/1) ... [2018-02-04 04:07:03,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03" (1/1) ... [2018-02-04 04:07:03,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:07:03,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:07:03,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:07:03,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:07:03,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:07:03,867 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:07:03,867 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:07:03,867 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 04:07:03,868 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:07:03,868 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 04:07:03,868 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 04:07:03,868 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:07:03,868 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:07:03,868 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:07:03,954 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:07:03,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:07:03 BoogieIcfgContainer [2018-02-04 04:07:03,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:07:03,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:07:03,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:07:03,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:07:03,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:07:03" (1/3) ... [2018-02-04 04:07:03,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c6b9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:07:03, skipping insertion in model container [2018-02-04 04:07:03,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:03" (2/3) ... [2018-02-04 04:07:03,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c6b9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:07:03, skipping insertion in model container [2018-02-04 04:07:03,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:07:03" (3/3) ... [2018-02-04 04:07:03,961 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-02-04 04:07:03,968 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:07:03,973 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-02-04 04:07:04,005 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:07:04,005 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:07:04,005 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:07:04,005 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:07:04,005 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:07:04,005 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:07:04,006 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:07:04,006 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:07:04,006 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:07:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-04 04:07:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 04:07:04,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:04,021 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:04,021 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1734695582, now seen corresponding path program 1 times [2018-02-04 04:07:04,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:04,026 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:04,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:04,066 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:04,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:04,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:04,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:04,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:07:04,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:07:04,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:07:04,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:04,162 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-02-04 04:07:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:04,236 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-04 04:07:04,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:07:04,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 04:07:04,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:04,242 INFO L225 Difference]: With dead ends: 50 [2018-02-04 04:07:04,243 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 04:07:04,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 04:07:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-02-04 04:07:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 04:07:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-02-04 04:07:04,311 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 7 [2018-02-04 04:07:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:04,312 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-02-04 04:07:04,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:07:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-02-04 04:07:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:07:04,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:04,312 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:04,312 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash 337601429, now seen corresponding path program 1 times [2018-02-04 04:07:04,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:04,313 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:04,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:04,314 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:04,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:04,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:04,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:04,353 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:04,353 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:04,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:04,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:04,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-04 04:07:04,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:07:04,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:07:04,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:07:04,381 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2018-02-04 04:07:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:04,461 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 04:07:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:07:04,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 04:07:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:04,463 INFO L225 Difference]: With dead ends: 54 [2018-02-04 04:07:04,463 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 04:07:04,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:07:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 04:07:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-02-04 04:07:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 04:07:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 04:07:04,469 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2018-02-04 04:07:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:04,469 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 04:07:04,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:07:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 04:07:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:07:04,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:04,470 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:04,471 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1746445058, now seen corresponding path program 2 times [2018-02-04 04:07:04,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:04,471 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:04,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:04,472 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:04,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:04,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:04,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:04,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:04,536 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:07:04,547 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:07:04,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:04,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:04,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:04,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-04 04:07:04,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:07:04,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:07:04,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:04,556 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-02-04 04:07:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:04,718 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 04:07:04,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:07:04,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:07:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:04,720 INFO L225 Difference]: With dead ends: 67 [2018-02-04 04:07:04,720 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 04:07:04,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 04:07:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-04 04:07:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 04:07:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 04:07:04,728 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 17 [2018-02-04 04:07:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:04,728 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 04:07:04,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:07:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 04:07:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:07:04,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:04,729 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:04,729 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash -228598475, now seen corresponding path program 3 times [2018-02-04 04:07:04,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:04,730 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:04,730 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:04,731 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:04,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:04,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:04,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:04,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:04,783 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:07:04,792 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 04:07:04,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:04,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:04,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:04,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 04:07:04,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:07:04,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:07:04,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:07:04,802 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2018-02-04 04:07:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:04,998 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-04 04:07:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:07:04,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 04:07:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:04,999 INFO L225 Difference]: With dead ends: 80 [2018-02-04 04:07:04,999 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 04:07:05,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:07:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 04:07:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-02-04 04:07:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 04:07:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-04 04:07:05,003 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 22 [2018-02-04 04:07:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:05,003 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-04 04:07:05,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:07:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-04 04:07:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:07:05,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:05,004 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:05,004 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash 756148062, now seen corresponding path program 4 times [2018-02-04 04:07:05,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:05,004 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:05,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:05,005 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:05,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:05,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:05,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:05,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:05,070 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:07:05,080 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:07:05,081 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:05,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:05,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:05,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 04:07:05,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:07:05,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:07:05,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:07:05,104 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 7 states. [2018-02-04 04:07:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:05,284 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-02-04 04:07:05,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:07:05,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 04:07:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:05,285 INFO L225 Difference]: With dead ends: 93 [2018-02-04 04:07:05,285 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 04:07:05,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:07:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 04:07:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-02-04 04:07:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 04:07:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-04 04:07:05,292 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 27 [2018-02-04 04:07:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:05,292 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-04 04:07:05,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:07:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-04 04:07:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:07:05,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:05,293 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:05,294 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash 671928021, now seen corresponding path program 5 times [2018-02-04 04:07:05,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:05,294 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:05,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:05,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:05,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:05,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:05,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:05,358 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:05,359 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:07:05,370 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 04:07:05,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:05,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:05,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:05,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-02-04 04:07:05,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:07:05,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:07:05,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:07:05,422 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 14 states. [2018-02-04 04:07:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:05,641 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-02-04 04:07:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:07:05,642 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-02-04 04:07:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:05,642 INFO L225 Difference]: With dead ends: 106 [2018-02-04 04:07:05,643 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 04:07:05,643 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:07:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 04:07:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-02-04 04:07:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 04:07:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-02-04 04:07:05,648 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 32 [2018-02-04 04:07:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:05,648 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-02-04 04:07:05,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:07:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-02-04 04:07:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 04:07:05,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:05,649 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:05,649 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -203753026, now seen corresponding path program 6 times [2018-02-04 04:07:05,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:05,649 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:05,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:05,650 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:05,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:05,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:05,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:05,716 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:05,717 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:07:05,726 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 04:07:05,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:05,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:05,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:05,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-02-04 04:07:05,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:07:05,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:07:05,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:07:05,758 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 13 states. [2018-02-04 04:07:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:05,910 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-02-04 04:07:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:07:05,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 04:07:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:05,911 INFO L225 Difference]: With dead ends: 119 [2018-02-04 04:07:05,911 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 04:07:05,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:07:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 04:07:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-02-04 04:07:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 04:07:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-04 04:07:05,916 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 37 [2018-02-04 04:07:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:05,916 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-04 04:07:05,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:07:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-04 04:07:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:07:05,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:05,917 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:05,917 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1846527883, now seen corresponding path program 7 times [2018-02-04 04:07:05,917 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:05,917 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:05,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:05,917 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:05,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:05,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:05,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:05,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:05,993 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:06,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:06,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:06,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 04:07:06,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:07:06,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:07:06,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:07:06,013 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 11 states. [2018-02-04 04:07:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:06,193 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-02-04 04:07:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:07:06,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 04:07:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:06,194 INFO L225 Difference]: With dead ends: 132 [2018-02-04 04:07:06,194 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 04:07:06,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:07:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 04:07:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-02-04 04:07:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 04:07:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-02-04 04:07:06,200 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 42 [2018-02-04 04:07:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:06,201 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-02-04 04:07:06,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:07:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-02-04 04:07:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 04:07:06,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:06,202 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:06,202 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2109248542, now seen corresponding path program 8 times [2018-02-04 04:07:06,202 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:06,203 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:06,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:06,203 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:06,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:06,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:06,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:06,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:06,325 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:07:06,333 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:07:06,333 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:06,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:06,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:06,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 04:07:06,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:07:06,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:07:06,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:07:06,345 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 11 states. [2018-02-04 04:07:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:06,768 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-02-04 04:07:06,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:07:06,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 04:07:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:06,769 INFO L225 Difference]: With dead ends: 145 [2018-02-04 04:07:06,769 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 04:07:06,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:07:06,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 04:07:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2018-02-04 04:07:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 04:07:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-02-04 04:07:06,784 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 47 [2018-02-04 04:07:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:06,785 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-02-04 04:07:06,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:07:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-02-04 04:07:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 04:07:06,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:06,787 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:06,787 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:06,787 INFO L82 PathProgramCache]: Analyzing trace with hash 408164885, now seen corresponding path program 9 times [2018-02-04 04:07:06,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:06,788 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:06,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:06,789 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:06,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:06,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:06,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:06,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:06,882 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:07:06,892 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 04:07:06,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:06,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:06,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:06,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 04:07:06,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:07:06,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:07:06,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:07:06,955 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 23 states. [2018-02-04 04:07:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:07,334 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-02-04 04:07:07,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:07:07,335 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-04 04:07:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:07,335 INFO L225 Difference]: With dead ends: 158 [2018-02-04 04:07:07,336 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 04:07:07,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:07:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 04:07:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-02-04 04:07:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 04:07:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2018-02-04 04:07:07,342 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 52 [2018-02-04 04:07:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:07,342 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2018-02-04 04:07:07,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:07:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-02-04 04:07:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 04:07:07,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:07,344 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:07,344 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2136951170, now seen corresponding path program 10 times [2018-02-04 04:07:07,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:07,344 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:07,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:07,345 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:07,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:07,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:07,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:07,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:07,459 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:07:07,468 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:07:07,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:07,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:07,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:07,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-02-04 04:07:07,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:07:07,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:07:07,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:07:07,482 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand 14 states. [2018-02-04 04:07:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:07,775 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-02-04 04:07:07,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:07:07,775 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-02-04 04:07:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:07,776 INFO L225 Difference]: With dead ends: 171 [2018-02-04 04:07:07,776 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 04:07:07,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:07:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 04:07:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-02-04 04:07:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 04:07:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-02-04 04:07:07,781 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 57 [2018-02-04 04:07:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:07,781 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-02-04 04:07:07,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:07:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-02-04 04:07:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 04:07:07,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:07,783 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:07,783 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1325560757, now seen corresponding path program 11 times [2018-02-04 04:07:07,783 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:07,783 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:07,784 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:07,784 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:07,784 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:07,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:07,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:07,891 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:07,891 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:07:07,903 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 04:07:07,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:07,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:08,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:08,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-02-04 04:07:08,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:07:08,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:07:08,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:07:08,031 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 26 states. [2018-02-04 04:07:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:08,583 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-02-04 04:07:08,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:07:08,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-04 04:07:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:08,584 INFO L225 Difference]: With dead ends: 184 [2018-02-04 04:07:08,584 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 04:07:08,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:07:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 04:07:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-02-04 04:07:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 04:07:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-02-04 04:07:08,588 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 62 [2018-02-04 04:07:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:08,588 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-02-04 04:07:08,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:07:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-02-04 04:07:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 04:07:08,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:08,589 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:08,589 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:08,589 INFO L82 PathProgramCache]: Analyzing trace with hash 923361502, now seen corresponding path program 12 times [2018-02-04 04:07:08,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:08,590 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:08,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:08,590 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:08,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:08,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:08,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:08,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:08,697 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:07:08,709 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 04:07:08,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:08,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:08,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:08,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-02-04 04:07:08,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:07:08,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:07:08,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:07:08,835 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 29 states. [2018-02-04 04:07:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:09,240 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-02-04 04:07:09,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:07:09,241 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-02-04 04:07:09,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:09,241 INFO L225 Difference]: With dead ends: 197 [2018-02-04 04:07:09,241 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 04:07:09,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:07:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 04:07:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-02-04 04:07:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 04:07:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-02-04 04:07:09,244 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 67 [2018-02-04 04:07:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:09,244 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-02-04 04:07:09,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:07:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-02-04 04:07:09,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 04:07:09,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:09,246 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:09,246 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 356861269, now seen corresponding path program 13 times [2018-02-04 04:07:09,246 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:09,246 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:09,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:09,247 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:09,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:09,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:09,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:09,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:09,353 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:09,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:09,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:09,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-02-04 04:07:09,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:07:09,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:07:09,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:07:09,377 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 17 states. [2018-02-04 04:07:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:09,608 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-02-04 04:07:09,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:07:09,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-04 04:07:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:09,609 INFO L225 Difference]: With dead ends: 210 [2018-02-04 04:07:09,609 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 04:07:09,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:07:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 04:07:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2018-02-04 04:07:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 04:07:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2018-02-04 04:07:09,613 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 72 [2018-02-04 04:07:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:09,613 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2018-02-04 04:07:09,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:07:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-02-04 04:07:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 04:07:09,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:09,614 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:09,614 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1075276994, now seen corresponding path program 14 times [2018-02-04 04:07:09,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:09,614 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:09,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:09,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:09,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:09,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:09,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:09,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:09,741 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:07:09,747 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:07:09,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:09,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:09,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:09,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-02-04 04:07:09,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:07:09,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:07:09,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:07:09,762 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 18 states. [2018-02-04 04:07:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:10,068 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-02-04 04:07:10,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:07:10,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-04 04:07:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:10,069 INFO L225 Difference]: With dead ends: 223 [2018-02-04 04:07:10,069 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 04:07:10,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:07:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 04:07:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2018-02-04 04:07:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 04:07:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-02-04 04:07:10,074 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 77 [2018-02-04 04:07:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:10,075 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-02-04 04:07:10,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:07:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-02-04 04:07:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 04:07:10,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:10,076 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:10,076 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:10,076 INFO L82 PathProgramCache]: Analyzing trace with hash 904302325, now seen corresponding path program 15 times [2018-02-04 04:07:10,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:10,076 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:10,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:10,077 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:10,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:10,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:10,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:10,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:10,185 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:07:10,195 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 04:07:10,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:10,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:10,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:10,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-04 04:07:10,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:07:10,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:07:10,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:07:10,304 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 35 states. [2018-02-04 04:07:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:11,162 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-02-04 04:07:11,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:07:11,162 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-02-04 04:07:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:11,163 INFO L225 Difference]: With dead ends: 236 [2018-02-04 04:07:11,163 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 04:07:11,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:07:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 04:07:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-02-04 04:07:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 04:07:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2018-02-04 04:07:11,168 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 82 [2018-02-04 04:07:11,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:11,169 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2018-02-04 04:07:11,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:07:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2018-02-04 04:07:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:07:11,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:11,170 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:11,170 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:11,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2125745566, now seen corresponding path program 16 times [2018-02-04 04:07:11,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:11,170 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:11,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:11,171 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:11,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:11,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:11,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:11,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:11,340 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:07:11,346 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:07:11,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:11,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:11,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:11,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-02-04 04:07:11,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:07:11,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:07:11,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:07:11,362 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand 19 states. [2018-02-04 04:07:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:12,356 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-02-04 04:07:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:07:12,357 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-04 04:07:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:12,357 INFO L225 Difference]: With dead ends: 249 [2018-02-04 04:07:12,358 INFO L226 Difference]: Without dead ends: 249 [2018-02-04 04:07:12,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:07:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-04 04:07:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 230. [2018-02-04 04:07:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-04 04:07:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-02-04 04:07:12,361 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 87 [2018-02-04 04:07:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:12,361 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-02-04 04:07:12,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:07:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-02-04 04:07:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 04:07:12,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:12,362 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:12,362 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash 120606869, now seen corresponding path program 17 times [2018-02-04 04:07:12,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:12,362 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:12,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:12,363 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:12,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:12,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:12,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:12,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:12,477 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:07:12,487 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 04:07:12,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:12,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:12,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:12,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-02-04 04:07:12,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 04:07:12,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 04:07:12,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:07:12,642 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 38 states. [2018-02-04 04:07:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:13,458 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-02-04 04:07:13,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:07:13,458 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 92 [2018-02-04 04:07:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:13,459 INFO L225 Difference]: With dead ends: 262 [2018-02-04 04:07:13,459 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 04:07:13,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:07:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 04:07:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2018-02-04 04:07:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 04:07:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-02-04 04:07:13,464 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 92 [2018-02-04 04:07:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:13,464 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-02-04 04:07:13,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 04:07:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-02-04 04:07:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 04:07:13,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:13,466 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:13,466 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2070056958, now seen corresponding path program 18 times [2018-02-04 04:07:13,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:13,466 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:13,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:13,467 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:13,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:13,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:13,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:13,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:13,638 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:07:13,650 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 04:07:13,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:13,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:13,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:13,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-04 04:07:13,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:07:13,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:07:13,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:07:13,782 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 41 states. [2018-02-04 04:07:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:15,018 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-02-04 04:07:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:07:15,019 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-02-04 04:07:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:15,019 INFO L225 Difference]: With dead ends: 275 [2018-02-04 04:07:15,020 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 04:07:15,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:07:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 04:07:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2018-02-04 04:07:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 04:07:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 292 transitions. [2018-02-04 04:07:15,023 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 292 transitions. Word has length 97 [2018-02-04 04:07:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:15,023 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 292 transitions. [2018-02-04 04:07:15,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:07:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 292 transitions. [2018-02-04 04:07:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 04:07:15,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:15,024 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:15,024 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash 183274037, now seen corresponding path program 19 times [2018-02-04 04:07:15,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:15,024 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:15,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:15,024 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:15,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:15,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:15,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:15,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:15,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:15,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:15,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:15,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-02-04 04:07:15,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:07:15,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:07:15,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:07:15,235 INFO L87 Difference]: Start difference. First operand 254 states and 292 transitions. Second operand 23 states. [2018-02-04 04:07:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:15,707 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-02-04 04:07:15,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:07:15,707 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-04 04:07:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:15,708 INFO L225 Difference]: With dead ends: 288 [2018-02-04 04:07:15,708 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 04:07:15,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:07:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 04:07:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2018-02-04 04:07:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 04:07:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-02-04 04:07:15,711 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 102 [2018-02-04 04:07:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:15,712 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-02-04 04:07:15,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:07:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-02-04 04:07:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 04:07:15,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:15,712 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:15,712 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:15,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1033282978, now seen corresponding path program 20 times [2018-02-04 04:07:15,712 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:15,713 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:15,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:15,713 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:15,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:15,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:15,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:15,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:15,930 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:07:15,939 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:07:15,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:15,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:15,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:15,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-02-04 04:07:15,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:07:15,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:07:15,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:07:15,960 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 24 states. [2018-02-04 04:07:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:16,675 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-02-04 04:07:16,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:07:16,675 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-04 04:07:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:16,676 INFO L225 Difference]: With dead ends: 301 [2018-02-04 04:07:16,676 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 04:07:16,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:07:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 04:07:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 278. [2018-02-04 04:07:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-04 04:07:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 320 transitions. [2018-02-04 04:07:16,681 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 320 transitions. Word has length 107 [2018-02-04 04:07:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:16,682 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 320 transitions. [2018-02-04 04:07:16,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:07:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 320 transitions. [2018-02-04 04:07:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 04:07:16,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:16,683 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:16,683 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1905968171, now seen corresponding path program 21 times [2018-02-04 04:07:16,683 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:16,683 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:16,684 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:16,684 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:16,684 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:16,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:16,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:16,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:16,915 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:07:16,923 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 04:07:16,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:16,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:16,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:16,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-02-04 04:07:16,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 04:07:16,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 04:07:16,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:07:16,938 INFO L87 Difference]: Start difference. First operand 278 states and 320 transitions. Second operand 25 states. [2018-02-04 04:07:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:17,599 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-02-04 04:07:17,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 04:07:17,599 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-04 04:07:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:17,600 INFO L225 Difference]: With dead ends: 314 [2018-02-04 04:07:17,600 INFO L226 Difference]: Without dead ends: 314 [2018-02-04 04:07:17,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:07:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-04 04:07:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 290. [2018-02-04 04:07:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-04 04:07:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2018-02-04 04:07:17,608 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 112 [2018-02-04 04:07:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:17,608 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-02-04 04:07:17,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 04:07:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2018-02-04 04:07:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 04:07:17,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:17,609 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:17,609 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash -994136898, now seen corresponding path program 22 times [2018-02-04 04:07:17,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:17,609 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:17,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:17,610 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:17,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:17,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:17,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:17,837 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:17,837 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:07:17,846 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:07:17,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:17,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:17,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:17,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-02-04 04:07:17,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 04:07:17,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 04:07:17,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:07:17,892 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand 26 states. [2018-02-04 04:07:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:18,604 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-02-04 04:07:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:07:18,604 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-04 04:07:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:18,605 INFO L225 Difference]: With dead ends: 327 [2018-02-04 04:07:18,605 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 04:07:18,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 04:07:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 04:07:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-02-04 04:07:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-04 04:07:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 348 transitions. [2018-02-04 04:07:18,610 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 348 transitions. Word has length 117 [2018-02-04 04:07:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:18,611 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 348 transitions. [2018-02-04 04:07:18,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 04:07:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 348 transitions. [2018-02-04 04:07:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 04:07:18,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:18,612 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:18,612 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1248093557, now seen corresponding path program 23 times [2018-02-04 04:07:18,612 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:18,612 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:18,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:18,613 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:18,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:18,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:18,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:18,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:18,852 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:07:18,864 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 04:07:18,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:18,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:19,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:19,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2018-02-04 04:07:19,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 04:07:19,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 04:07:19,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:07:19,120 INFO L87 Difference]: Start difference. First operand 302 states and 348 transitions. Second operand 50 states. [2018-02-04 04:07:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:21,277 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-02-04 04:07:21,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:07:21,277 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 122 [2018-02-04 04:07:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:21,278 INFO L225 Difference]: With dead ends: 340 [2018-02-04 04:07:21,278 INFO L226 Difference]: Without dead ends: 340 [2018-02-04 04:07:21,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:07:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-04 04:07:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 314. [2018-02-04 04:07:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-04 04:07:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-02-04 04:07:21,284 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 122 [2018-02-04 04:07:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:21,285 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-02-04 04:07:21,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 04:07:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-02-04 04:07:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 04:07:21,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:21,286 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:21,286 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:21,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1210546402, now seen corresponding path program 24 times [2018-02-04 04:07:21,286 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:21,286 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:21,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:21,288 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:21,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:21,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:21,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:21,562 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:21,562 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:07:21,572 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 04:07:21,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:21,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:21,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:21,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-02-04 04:07:21,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:07:21,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:07:21,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:07:21,833 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 37 states. [2018-02-04 04:07:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:22,771 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-02-04 04:07:22,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:07:22,771 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-02-04 04:07:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:22,772 INFO L225 Difference]: With dead ends: 353 [2018-02-04 04:07:22,772 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 04:07:22,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1067, Invalid=2593, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:07:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 04:07:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 326. [2018-02-04 04:07:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 04:07:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 376 transitions. [2018-02-04 04:07:22,776 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 376 transitions. Word has length 127 [2018-02-04 04:07:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:22,776 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 376 transitions. [2018-02-04 04:07:22,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:07:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 376 transitions. [2018-02-04 04:07:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 04:07:22,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:22,776 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:22,776 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash 53741333, now seen corresponding path program 25 times [2018-02-04 04:07:22,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:22,777 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:22,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:22,777 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:22,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:22,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:22,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:22,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:22,993 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:23,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:23,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:23,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-02-04 04:07:23,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:07:23,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:07:23,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:07:23,014 INFO L87 Difference]: Start difference. First operand 326 states and 376 transitions. Second operand 29 states. [2018-02-04 04:07:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:23,634 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-02-04 04:07:23,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:07:23,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-02-04 04:07:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:23,635 INFO L225 Difference]: With dead ends: 366 [2018-02-04 04:07:23,635 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 04:07:23,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:07:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 04:07:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2018-02-04 04:07:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 04:07:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 390 transitions. [2018-02-04 04:07:23,641 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 390 transitions. Word has length 132 [2018-02-04 04:07:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:23,641 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 390 transitions. [2018-02-04 04:07:23,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:07:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 390 transitions. [2018-02-04 04:07:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 04:07:23,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:23,643 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:23,643 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash -173217410, now seen corresponding path program 26 times [2018-02-04 04:07:23,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:23,643 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:23,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:23,644 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:23,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:23,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:23,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:23,937 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:23,937 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:07:23,943 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:07:23,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:23,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:23,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:23,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-02-04 04:07:23,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 04:07:23,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 04:07:23,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:07:23,970 INFO L87 Difference]: Start difference. First operand 338 states and 390 transitions. Second operand 30 states. [2018-02-04 04:07:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:24,665 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-02-04 04:07:24,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:07:24,666 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-02-04 04:07:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:24,667 INFO L225 Difference]: With dead ends: 379 [2018-02-04 04:07:24,667 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 04:07:24,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:07:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 04:07:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 350. [2018-02-04 04:07:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 04:07:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 404 transitions. [2018-02-04 04:07:24,672 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 404 transitions. Word has length 137 [2018-02-04 04:07:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:24,673 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 404 transitions. [2018-02-04 04:07:24,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 04:07:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 404 transitions. [2018-02-04 04:07:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 04:07:24,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:24,674 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:24,674 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:24,674 INFO L82 PathProgramCache]: Analyzing trace with hash 681451701, now seen corresponding path program 27 times [2018-02-04 04:07:24,674 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:24,674 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:24,675 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:24,675 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:24,675 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:24,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:25,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:25,011 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:25,012 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:07:25,023 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 04:07:25,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:25,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:25,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:25,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-02-04 04:07:25,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 04:07:25,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 04:07:25,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:07:25,041 INFO L87 Difference]: Start difference. First operand 350 states and 404 transitions. Second operand 31 states. [2018-02-04 04:07:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:25,710 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-02-04 04:07:25,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 04:07:25,711 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-02-04 04:07:25,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:25,712 INFO L225 Difference]: With dead ends: 392 [2018-02-04 04:07:25,712 INFO L226 Difference]: Without dead ends: 392 [2018-02-04 04:07:25,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 04:07:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-04 04:07:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2018-02-04 04:07:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-04 04:07:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 418 transitions. [2018-02-04 04:07:25,716 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 418 transitions. Word has length 142 [2018-02-04 04:07:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:25,717 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 418 transitions. [2018-02-04 04:07:25,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 04:07:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 418 transitions. [2018-02-04 04:07:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 04:07:25,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:25,718 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:25,718 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:25,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1555157982, now seen corresponding path program 28 times [2018-02-04 04:07:25,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:25,718 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:25,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:25,719 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:25,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:25,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:25,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:25,976 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:25,976 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:07:25,982 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:07:25,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:25,983 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:26,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:26,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-02-04 04:07:26,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 04:07:26,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 04:07:26,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:07:26,280 INFO L87 Difference]: Start difference. First operand 362 states and 418 transitions. Second operand 61 states. [2018-02-04 04:07:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:28,460 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-02-04 04:07:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:07:28,460 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-02-04 04:07:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:28,461 INFO L225 Difference]: With dead ends: 405 [2018-02-04 04:07:28,461 INFO L226 Difference]: Without dead ends: 405 [2018-02-04 04:07:28,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:07:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-04 04:07:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 374. [2018-02-04 04:07:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 04:07:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 432 transitions. [2018-02-04 04:07:28,467 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 432 transitions. Word has length 147 [2018-02-04 04:07:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:28,467 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 432 transitions. [2018-02-04 04:07:28,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 04:07:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 432 transitions. [2018-02-04 04:07:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-04 04:07:28,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:28,469 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:28,469 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1978446421, now seen corresponding path program 29 times [2018-02-04 04:07:28,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:28,469 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:28,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:28,470 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:28,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:28,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:28,846 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:28,846 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:28,846 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:07:28,858 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 04:07:28,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:28,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:29,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:29,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2018-02-04 04:07:29,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 04:07:29,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 04:07:29,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 04:07:29,217 INFO L87 Difference]: Start difference. First operand 374 states and 432 transitions. Second operand 62 states. [2018-02-04 04:07:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:31,933 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-02-04 04:07:31,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:07:31,934 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2018-02-04 04:07:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:31,935 INFO L225 Difference]: With dead ends: 418 [2018-02-04 04:07:31,935 INFO L226 Difference]: Without dead ends: 418 [2018-02-04 04:07:31,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:07:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-04 04:07:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 386. [2018-02-04 04:07:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-04 04:07:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 446 transitions. [2018-02-04 04:07:31,940 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 446 transitions. Word has length 152 [2018-02-04 04:07:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:31,940 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 446 transitions. [2018-02-04 04:07:31,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 04:07:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 446 transitions. [2018-02-04 04:07:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 04:07:31,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:31,942 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:31,942 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1344453058, now seen corresponding path program 30 times [2018-02-04 04:07:31,942 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:31,942 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:31,943 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:31,943 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:31,943 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:31,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:32,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:32,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:32,410 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:07:32,422 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 04:07:32,422 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:32,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:32,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:32,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-02-04 04:07:32,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:07:32,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:07:32,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:07:32,478 INFO L87 Difference]: Start difference. First operand 386 states and 446 transitions. Second operand 37 states. [2018-02-04 04:07:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:33,243 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-02-04 04:07:33,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:07:33,243 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-02-04 04:07:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:33,244 INFO L225 Difference]: With dead ends: 431 [2018-02-04 04:07:33,244 INFO L226 Difference]: Without dead ends: 431 [2018-02-04 04:07:33,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1562, Invalid=2860, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 04:07:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-04 04:07:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 398. [2018-02-04 04:07:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-04 04:07:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2018-02-04 04:07:33,249 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 157 [2018-02-04 04:07:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:33,249 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2018-02-04 04:07:33,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:07:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2018-02-04 04:07:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 04:07:33,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:33,251 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:33,251 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:33,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1846952971, now seen corresponding path program 31 times [2018-02-04 04:07:33,251 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:33,251 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:33,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:33,252 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:33,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:33,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:33,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:33,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:33,579 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:33,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:33,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:33,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 04:07:33,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:07:33,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:07:33,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:07:33,622 INFO L87 Difference]: Start difference. First operand 398 states and 460 transitions. Second operand 35 states. [2018-02-04 04:07:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:34,410 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-02-04 04:07:34,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 04:07:34,410 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-02-04 04:07:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:34,411 INFO L225 Difference]: With dead ends: 444 [2018-02-04 04:07:34,411 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 04:07:34,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 04:07:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 04:07:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2018-02-04 04:07:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:07:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 474 transitions. [2018-02-04 04:07:34,417 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 474 transitions. Word has length 162 [2018-02-04 04:07:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:34,417 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 474 transitions. [2018-02-04 04:07:34,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:07:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 474 transitions. [2018-02-04 04:07:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 04:07:34,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:34,419 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:34,419 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash -156942178, now seen corresponding path program 32 times [2018-02-04 04:07:34,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:34,419 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:34,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:34,420 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:34,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:34,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:34,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:34,941 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:34,941 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:07:34,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:07:34,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:34,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:35,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:35,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 04:07:35,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:07:35,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:07:35,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:07:35,003 INFO L87 Difference]: Start difference. First operand 410 states and 474 transitions. Second operand 35 states. [2018-02-04 04:07:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:38,286 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-02-04 04:07:38,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:07:38,287 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-04 04:07:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:38,288 INFO L225 Difference]: With dead ends: 457 [2018-02-04 04:07:38,288 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 04:07:38,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:07:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 04:07:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-02-04 04:07:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 04:07:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 488 transitions. [2018-02-04 04:07:38,292 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 488 transitions. Word has length 167 [2018-02-04 04:07:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:38,292 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 488 transitions. [2018-02-04 04:07:38,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:07:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 488 transitions. [2018-02-04 04:07:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 04:07:38,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:38,293 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:38,293 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:38,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1361101419, now seen corresponding path program 33 times [2018-02-04 04:07:38,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:38,293 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:38,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,294 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:38,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:38,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:38,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:38,785 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:38,785 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:07:38,801 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 04:07:38,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:38,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:38,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:38,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-02-04 04:07:38,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:07:38,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:07:38,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:07:38,840 INFO L87 Difference]: Start difference. First operand 422 states and 488 transitions. Second operand 37 states. [2018-02-04 04:07:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:39,804 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-02-04 04:07:39,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 04:07:39,805 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-02-04 04:07:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:39,806 INFO L225 Difference]: With dead ends: 470 [2018-02-04 04:07:39,806 INFO L226 Difference]: Without dead ends: 470 [2018-02-04 04:07:39,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 04:07:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-02-04 04:07:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2018-02-04 04:07:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-04 04:07:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-02-04 04:07:39,810 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 172 [2018-02-04 04:07:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:39,811 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2018-02-04 04:07:39,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:07:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2018-02-04 04:07:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 04:07:39,812 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:39,812 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:39,812 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:39,812 INFO L82 PathProgramCache]: Analyzing trace with hash -587218178, now seen corresponding path program 34 times [2018-02-04 04:07:39,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:39,812 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:39,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,813 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:39,813 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:39,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:40,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:40,354 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:40,354 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:07:40,366 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:07:40,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:40,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:40,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:40,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-02-04 04:07:40,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 04:07:40,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 04:07:40,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:07:40,406 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand 38 states. [2018-02-04 04:07:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:41,529 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-02-04 04:07:41,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 04:07:41,529 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-02-04 04:07:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:41,531 INFO L225 Difference]: With dead ends: 483 [2018-02-04 04:07:41,531 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 04:07:41,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 04:07:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 04:07:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 446. [2018-02-04 04:07:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-04 04:07:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 516 transitions. [2018-02-04 04:07:41,535 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 516 transitions. Word has length 177 [2018-02-04 04:07:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:41,535 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 516 transitions. [2018-02-04 04:07:41,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 04:07:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 516 transitions. [2018-02-04 04:07:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 04:07:41,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:41,537 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:41,537 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash 714553141, now seen corresponding path program 35 times [2018-02-04 04:07:41,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:41,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:41,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:41,538 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:41,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:41,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:42,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:42,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:42,013 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:07:42,031 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 04:07:42,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:42,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:42,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:42,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 73 [2018-02-04 04:07:42,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 04:07:42,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 04:07:42,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 04:07:42,700 INFO L87 Difference]: Start difference. First operand 446 states and 516 transitions. Second operand 74 states. [2018-02-04 04:07:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:47,981 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-02-04 04:07:47,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:07:47,982 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 182 [2018-02-04 04:07:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:47,983 INFO L225 Difference]: With dead ends: 496 [2018-02-04 04:07:47,983 INFO L226 Difference]: Without dead ends: 496 [2018-02-04 04:07:47,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 04:07:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-02-04 04:07:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 458. [2018-02-04 04:07:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-04 04:07:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 530 transitions. [2018-02-04 04:07:47,988 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 530 transitions. Word has length 182 [2018-02-04 04:07:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:47,988 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 530 transitions. [2018-02-04 04:07:47,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 04:07:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 530 transitions. [2018-02-04 04:07:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 04:07:47,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:47,989 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:47,990 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:47,990 INFO L82 PathProgramCache]: Analyzing trace with hash 325242206, now seen corresponding path program 36 times [2018-02-04 04:07:47,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:47,990 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:47,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:47,991 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:47,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:47,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:48,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:48,455 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:48,455 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:07:48,468 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 04:07:48,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:48,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:48,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:48,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-02-04 04:07:48,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 04:07:48,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 04:07:48,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:07:48,583 INFO L87 Difference]: Start difference. First operand 458 states and 530 transitions. Second operand 45 states. [2018-02-04 04:07:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:49,790 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-02-04 04:07:49,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:07:49,790 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-02-04 04:07:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:49,791 INFO L225 Difference]: With dead ends: 509 [2018-02-04 04:07:49,791 INFO L226 Difference]: Without dead ends: 509 [2018-02-04 04:07:49,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 04:07:49,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-04 04:07:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 470. [2018-02-04 04:07:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-02-04 04:07:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 544 transitions. [2018-02-04 04:07:49,795 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 544 transitions. Word has length 187 [2018-02-04 04:07:49,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:49,795 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 544 transitions. [2018-02-04 04:07:49,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 04:07:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 544 transitions. [2018-02-04 04:07:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 04:07:49,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:49,796 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:49,796 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:49,796 INFO L82 PathProgramCache]: Analyzing trace with hash 777758933, now seen corresponding path program 37 times [2018-02-04 04:07:49,796 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:49,796 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:49,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:49,797 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:49,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:49,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:50,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:50,209 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:50,210 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:50,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:50,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:50,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-02-04 04:07:50,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:07:50,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:07:50,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:07:50,251 INFO L87 Difference]: Start difference. First operand 470 states and 544 transitions. Second operand 41 states. [2018-02-04 04:07:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:51,242 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-02-04 04:07:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 04:07:51,242 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-02-04 04:07:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:51,244 INFO L225 Difference]: With dead ends: 522 [2018-02-04 04:07:51,244 INFO L226 Difference]: Without dead ends: 522 [2018-02-04 04:07:51,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 04:07:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-04 04:07:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 482. [2018-02-04 04:07:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-04 04:07:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 558 transitions. [2018-02-04 04:07:51,248 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 558 transitions. Word has length 192 [2018-02-04 04:07:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:51,248 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 558 transitions. [2018-02-04 04:07:51,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:07:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 558 transitions. [2018-02-04 04:07:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 04:07:51,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:51,250 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:51,250 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1362862146, now seen corresponding path program 38 times [2018-02-04 04:07:51,250 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:51,250 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:51,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:51,251 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:51,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:51,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:51,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:51,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:51,695 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:07:51,701 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:07:51,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:51,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:51,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:51,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-02-04 04:07:51,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 04:07:51,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 04:07:51,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:07:51,726 INFO L87 Difference]: Start difference. First operand 482 states and 558 transitions. Second operand 42 states. [2018-02-04 04:07:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:52,964 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-02-04 04:07:52,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 04:07:52,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-02-04 04:07:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:52,966 INFO L225 Difference]: With dead ends: 535 [2018-02-04 04:07:52,966 INFO L226 Difference]: Without dead ends: 535 [2018-02-04 04:07:52,966 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 04:07:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-04 04:07:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 494. [2018-02-04 04:07:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-04 04:07:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 572 transitions. [2018-02-04 04:07:52,969 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 572 transitions. Word has length 197 [2018-02-04 04:07:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:52,970 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 572 transitions. [2018-02-04 04:07:52,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 04:07:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 572 transitions. [2018-02-04 04:07:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 04:07:52,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:52,970 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:52,971 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1324782197, now seen corresponding path program 39 times [2018-02-04 04:07:52,971 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:52,971 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:52,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:52,971 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:52,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:52,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:53,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:53,436 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:53,436 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:07:53,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 04:07:53,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:53,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:53,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:53,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-02-04 04:07:53,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 04:07:53,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 04:07:53,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 04:07:53,476 INFO L87 Difference]: Start difference. First operand 494 states and 572 transitions. Second operand 43 states. [2018-02-04 04:07:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:54,677 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-02-04 04:07:54,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 04:07:54,677 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-04 04:07:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:54,679 INFO L225 Difference]: With dead ends: 548 [2018-02-04 04:07:54,679 INFO L226 Difference]: Without dead ends: 548 [2018-02-04 04:07:54,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 04:07:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-04 04:07:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 506. [2018-02-04 04:07:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-02-04 04:07:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 586 transitions. [2018-02-04 04:07:54,683 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 586 transitions. Word has length 202 [2018-02-04 04:07:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:54,683 INFO L432 AbstractCegarLoop]: Abstraction has 506 states and 586 transitions. [2018-02-04 04:07:54,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 04:07:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 586 transitions. [2018-02-04 04:07:54,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 04:07:54,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:54,684 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:54,684 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:54,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2003142114, now seen corresponding path program 40 times [2018-02-04 04:07:54,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:54,684 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:54,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:54,685 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:54,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:54,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:55,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:55,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:55,137 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:07:55,144 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:07:55,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:55,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:55,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:55,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-02-04 04:07:55,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 04:07:55,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 04:07:55,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:07:55,174 INFO L87 Difference]: Start difference. First operand 506 states and 586 transitions. Second operand 44 states. [2018-02-04 04:07:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:56,881 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2018-02-04 04:07:56,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 04:07:56,881 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-02-04 04:07:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:56,883 INFO L225 Difference]: With dead ends: 561 [2018-02-04 04:07:56,883 INFO L226 Difference]: Without dead ends: 561 [2018-02-04 04:07:56,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 04:07:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-04 04:07:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 518. [2018-02-04 04:07:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-02-04 04:07:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 600 transitions. [2018-02-04 04:07:56,887 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 600 transitions. Word has length 207 [2018-02-04 04:07:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:56,887 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 600 transitions. [2018-02-04 04:07:56,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 04:07:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 600 transitions. [2018-02-04 04:07:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 04:07:56,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:56,888 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:56,888 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:07:56,888 INFO L82 PathProgramCache]: Analyzing trace with hash 749859861, now seen corresponding path program 41 times [2018-02-04 04:07:56,888 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:56,888 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:56,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,889 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:07:56,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:56,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:57,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:57,436 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:57,436 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:07:57,452 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 04:07:57,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:07:57,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:58,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:58,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 85 [2018-02-04 04:07:58,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-02-04 04:07:58,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-02-04 04:07:58,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 04:07:58,086 INFO L87 Difference]: Start difference. First operand 518 states and 600 transitions. Second operand 86 states. [2018-02-04 04:08:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:04,033 INFO L93 Difference]: Finished difference Result 574 states and 659 transitions. [2018-02-04 04:08:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 04:08:04,034 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 212 [2018-02-04 04:08:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:04,035 INFO L225 Difference]: With dead ends: 574 [2018-02-04 04:08:04,035 INFO L226 Difference]: Without dead ends: 574 [2018-02-04 04:08:04,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 04:08:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-04 04:08:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 530. [2018-02-04 04:08:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-04 04:08:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 614 transitions. [2018-02-04 04:08:04,039 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 614 transitions. Word has length 212 [2018-02-04 04:08:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:04,039 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 614 transitions. [2018-02-04 04:08:04,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-02-04 04:08:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 614 transitions. [2018-02-04 04:08:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 04:08:04,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:04,040 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:04,040 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1629807490, now seen corresponding path program 42 times [2018-02-04 04:08:04,040 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:04,040 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:04,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:04,040 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:04,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:04,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:04,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:04,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:04,573 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:08:04,586 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 04:08:04,586 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:04,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:04,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:04,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-02-04 04:08:04,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 04:08:04,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 04:08:04,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:08:04,675 INFO L87 Difference]: Start difference. First operand 530 states and 614 transitions. Second operand 49 states. [2018-02-04 04:08:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:06,356 INFO L93 Difference]: Finished difference Result 587 states and 674 transitions. [2018-02-04 04:08:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 04:08:06,357 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-02-04 04:08:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:06,358 INFO L225 Difference]: With dead ends: 587 [2018-02-04 04:08:06,358 INFO L226 Difference]: Without dead ends: 587 [2018-02-04 04:08:06,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2936, Invalid=5254, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 04:08:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-02-04 04:08:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 542. [2018-02-04 04:08:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-02-04 04:08:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 628 transitions. [2018-02-04 04:08:06,364 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 628 transitions. Word has length 217 [2018-02-04 04:08:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:06,365 INFO L432 AbstractCegarLoop]: Abstraction has 542 states and 628 transitions. [2018-02-04 04:08:06,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 04:08:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 628 transitions. [2018-02-04 04:08:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-04 04:08:06,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:06,366 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:06,366 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:06,366 INFO L82 PathProgramCache]: Analyzing trace with hash 324521397, now seen corresponding path program 43 times [2018-02-04 04:08:06,366 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:06,367 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:06,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:06,367 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:06,367 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:06,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:06,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:06,962 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:06,962 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:06,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:07,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:07,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-02-04 04:08:07,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 04:08:07,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 04:08:07,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:08:07,004 INFO L87 Difference]: Start difference. First operand 542 states and 628 transitions. Second operand 47 states. [2018-02-04 04:08:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:08,205 INFO L93 Difference]: Finished difference Result 600 states and 689 transitions. [2018-02-04 04:08:08,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 04:08:08,205 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-02-04 04:08:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:08,206 INFO L225 Difference]: With dead ends: 600 [2018-02-04 04:08:08,206 INFO L226 Difference]: Without dead ends: 600 [2018-02-04 04:08:08,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 04:08:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-02-04 04:08:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2018-02-04 04:08:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-02-04 04:08:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 642 transitions. [2018-02-04 04:08:08,211 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 642 transitions. Word has length 222 [2018-02-04 04:08:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:08,211 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 642 transitions. [2018-02-04 04:08:08,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 04:08:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 642 transitions. [2018-02-04 04:08:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 04:08:08,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:08,212 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:08,212 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:08,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1945913054, now seen corresponding path program 44 times [2018-02-04 04:08:08,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:08,212 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:08,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:08,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:08,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:08,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:08,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:08,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:08,795 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:08:08,802 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:08:08,802 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:08,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:08,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:08,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-02-04 04:08:08,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 04:08:08,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 04:08:08,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 04:08:08,941 INFO L87 Difference]: Start difference. First operand 554 states and 642 transitions. Second operand 55 states. [2018-02-04 04:08:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:10,713 INFO L93 Difference]: Finished difference Result 613 states and 704 transitions. [2018-02-04 04:08:10,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 04:08:10,713 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-02-04 04:08:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:10,714 INFO L225 Difference]: With dead ends: 613 [2018-02-04 04:08:10,714 INFO L226 Difference]: Without dead ends: 613 [2018-02-04 04:08:10,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3077, Invalid=6625, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 04:08:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-02-04 04:08:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 566. [2018-02-04 04:08:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-02-04 04:08:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 656 transitions. [2018-02-04 04:08:10,718 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 656 transitions. Word has length 227 [2018-02-04 04:08:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:10,719 INFO L432 AbstractCegarLoop]: Abstraction has 566 states and 656 transitions. [2018-02-04 04:08:10,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 04:08:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 656 transitions. [2018-02-04 04:08:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 04:08:10,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:10,720 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:10,720 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1707991211, now seen corresponding path program 45 times [2018-02-04 04:08:10,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:10,720 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:10,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:10,721 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:10,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:10,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:11,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:11,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:11,333 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:08:11,345 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 04:08:11,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:11,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:11,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:11,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-02-04 04:08:11,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 04:08:11,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 04:08:11,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:08:11,400 INFO L87 Difference]: Start difference. First operand 566 states and 656 transitions. Second operand 49 states. [2018-02-04 04:08:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:12,719 INFO L93 Difference]: Finished difference Result 626 states and 719 transitions. [2018-02-04 04:08:12,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 04:08:12,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-02-04 04:08:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:12,721 INFO L225 Difference]: With dead ends: 626 [2018-02-04 04:08:12,721 INFO L226 Difference]: Without dead ends: 626 [2018-02-04 04:08:12,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 04:08:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-02-04 04:08:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 578. [2018-02-04 04:08:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-04 04:08:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 670 transitions. [2018-02-04 04:08:12,729 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 670 transitions. Word has length 232 [2018-02-04 04:08:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:12,729 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 670 transitions. [2018-02-04 04:08:12,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 04:08:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 670 transitions. [2018-02-04 04:08:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 04:08:12,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:12,731 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:12,731 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:12,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1861482814, now seen corresponding path program 46 times [2018-02-04 04:08:12,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:12,731 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:12,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:12,732 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:12,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:12,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:13,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:13,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:13,448 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:08:13,456 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:08:13,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:13,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:13,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:13,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-02-04 04:08:13,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 04:08:13,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 04:08:13,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:08:13,489 INFO L87 Difference]: Start difference. First operand 578 states and 670 transitions. Second operand 50 states. [2018-02-04 04:08:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:15,008 INFO L93 Difference]: Finished difference Result 639 states and 734 transitions. [2018-02-04 04:08:15,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 04:08:15,008 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-02-04 04:08:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:15,010 INFO L225 Difference]: With dead ends: 639 [2018-02-04 04:08:15,010 INFO L226 Difference]: Without dead ends: 639 [2018-02-04 04:08:15,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 04:08:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-02-04 04:08:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 590. [2018-02-04 04:08:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-02-04 04:08:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 684 transitions. [2018-02-04 04:08:15,014 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 684 transitions. Word has length 237 [2018-02-04 04:08:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:15,014 INFO L432 AbstractCegarLoop]: Abstraction has 590 states and 684 transitions. [2018-02-04 04:08:15,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 04:08:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 684 transitions. [2018-02-04 04:08:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-04 04:08:15,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:15,015 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:15,015 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:15,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1141565685, now seen corresponding path program 47 times [2018-02-04 04:08:15,015 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:15,015 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:15,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:15,016 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:15,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:15,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:15,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:15,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:15,659 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:08:15,675 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 04:08:15,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:15,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:16,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:16,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 97 [2018-02-04 04:08:16,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-02-04 04:08:16,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-02-04 04:08:16,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-02-04 04:08:16,432 INFO L87 Difference]: Start difference. First operand 590 states and 684 transitions. Second operand 98 states. [2018-02-04 04:08:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:22,025 INFO L93 Difference]: Finished difference Result 652 states and 749 transitions. [2018-02-04 04:08:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 04:08:22,025 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 242 [2018-02-04 04:08:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:22,026 INFO L225 Difference]: With dead ends: 652 [2018-02-04 04:08:22,027 INFO L226 Difference]: Without dead ends: 652 [2018-02-04 04:08:22,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4419 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 04:08:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-02-04 04:08:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 602. [2018-02-04 04:08:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-02-04 04:08:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 698 transitions. [2018-02-04 04:08:22,031 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 698 transitions. Word has length 242 [2018-02-04 04:08:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:22,031 INFO L432 AbstractCegarLoop]: Abstraction has 602 states and 698 transitions. [2018-02-04 04:08:22,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-02-04 04:08:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 698 transitions. [2018-02-04 04:08:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-04 04:08:22,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:22,032 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:22,032 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash 993538974, now seen corresponding path program 48 times [2018-02-04 04:08:22,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:22,032 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:22,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:22,033 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:22,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:22,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:22,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:22,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:22,665 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:08:22,679 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 04:08:22,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:22,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:23,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:23,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 68 [2018-02-04 04:08:23,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 04:08:23,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 04:08:23,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=3260, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 04:08:23,092 INFO L87 Difference]: Start difference. First operand 602 states and 698 transitions. Second operand 69 states. [2018-02-04 04:08:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:26,186 INFO L93 Difference]: Finished difference Result 665 states and 764 transitions. [2018-02-04 04:08:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 04:08:26,187 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-02-04 04:08:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:26,188 INFO L225 Difference]: With dead ends: 665 [2018-02-04 04:08:26,188 INFO L226 Difference]: Without dead ends: 665 [2018-02-04 04:08:26,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3855, Invalid=9717, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 04:08:26,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-04 04:08:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 614. [2018-02-04 04:08:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-02-04 04:08:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 712 transitions. [2018-02-04 04:08:26,193 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 712 transitions. Word has length 247 [2018-02-04 04:08:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:26,193 INFO L432 AbstractCegarLoop]: Abstraction has 614 states and 712 transitions. [2018-02-04 04:08:26,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 04:08:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 712 transitions. [2018-02-04 04:08:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-04 04:08:26,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:26,194 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:26,194 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash 522988181, now seen corresponding path program 49 times [2018-02-04 04:08:26,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:26,194 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:26,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:26,194 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:26,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:26,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:26,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:26,915 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:26,915 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:26,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:26,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:26,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-02-04 04:08:26,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:08:26,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:08:26,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:08:26,969 INFO L87 Difference]: Start difference. First operand 614 states and 712 transitions. Second operand 53 states. [2018-02-04 04:08:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:28,605 INFO L93 Difference]: Finished difference Result 678 states and 779 transitions. [2018-02-04 04:08:28,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 04:08:28,605 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-02-04 04:08:28,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:28,607 INFO L225 Difference]: With dead ends: 678 [2018-02-04 04:08:28,607 INFO L226 Difference]: Without dead ends: 678 [2018-02-04 04:08:28,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 04:08:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-02-04 04:08:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 626. [2018-02-04 04:08:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-02-04 04:08:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 726 transitions. [2018-02-04 04:08:28,614 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 726 transitions. Word has length 252 [2018-02-04 04:08:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:28,614 INFO L432 AbstractCegarLoop]: Abstraction has 626 states and 726 transitions. [2018-02-04 04:08:28,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:08:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 726 transitions. [2018-02-04 04:08:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 04:08:28,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:28,616 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:28,616 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash 683603454, now seen corresponding path program 50 times [2018-02-04 04:08:28,616 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:28,616 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:28,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:28,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:28,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:28,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:29,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:29,385 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:29,386 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:08:29,394 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:08:29,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:29,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:29,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:29,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-02-04 04:08:29,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 04:08:29,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 04:08:29,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 04:08:29,509 INFO L87 Difference]: Start difference. First operand 626 states and 726 transitions. Second operand 58 states. [2018-02-04 04:08:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:31,453 INFO L93 Difference]: Finished difference Result 691 states and 794 transitions. [2018-02-04 04:08:31,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 04:08:31,453 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 257 [2018-02-04 04:08:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:31,455 INFO L225 Difference]: With dead ends: 691 [2018-02-04 04:08:31,455 INFO L226 Difference]: Without dead ends: 691 [2018-02-04 04:08:31,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4042, Invalid=7514, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 04:08:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-02-04 04:08:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 638. [2018-02-04 04:08:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-02-04 04:08:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 740 transitions. [2018-02-04 04:08:31,461 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 740 transitions. Word has length 257 [2018-02-04 04:08:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:31,462 INFO L432 AbstractCegarLoop]: Abstraction has 638 states and 740 transitions. [2018-02-04 04:08:31,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 04:08:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 740 transitions. [2018-02-04 04:08:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 04:08:31,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:31,463 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:31,463 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1700783157, now seen corresponding path program 51 times [2018-02-04 04:08:31,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:31,464 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:31,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:31,464 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:31,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:31,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:32,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:32,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:32,258 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:08:32,272 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 04:08:32,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:32,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:32,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:32,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-02-04 04:08:32,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 04:08:32,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 04:08:32,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 04:08:32,337 INFO L87 Difference]: Start difference. First operand 638 states and 740 transitions. Second operand 55 states. [2018-02-04 04:08:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:34,126 INFO L93 Difference]: Finished difference Result 704 states and 809 transitions. [2018-02-04 04:08:34,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 04:08:34,126 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-02-04 04:08:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:34,128 INFO L225 Difference]: With dead ends: 704 [2018-02-04 04:08:34,128 INFO L226 Difference]: Without dead ends: 704 [2018-02-04 04:08:34,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 04:08:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-02-04 04:08:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 650. [2018-02-04 04:08:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-02-04 04:08:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 754 transitions. [2018-02-04 04:08:34,132 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 754 transitions. Word has length 262 [2018-02-04 04:08:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:34,132 INFO L432 AbstractCegarLoop]: Abstraction has 650 states and 754 transitions. [2018-02-04 04:08:34,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 04:08:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 754 transitions. [2018-02-04 04:08:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-04 04:08:34,133 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:34,133 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:34,133 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1946271650, now seen corresponding path program 52 times [2018-02-04 04:08:34,134 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:34,134 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:34,134 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:34,134 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:34,134 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:34,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:34,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:34,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:34,960 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:08:34,968 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:08:34,968 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:34,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:35,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:35,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-02-04 04:08:35,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-02-04 04:08:35,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-02-04 04:08:35,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 04:08:35,859 INFO L87 Difference]: Start difference. First operand 650 states and 754 transitions. Second operand 109 states. [2018-02-04 04:08:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:42,415 INFO L93 Difference]: Finished difference Result 717 states and 824 transitions. [2018-02-04 04:08:42,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 04:08:42,415 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 267 [2018-02-04 04:08:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:42,416 INFO L225 Difference]: With dead ends: 717 [2018-02-04 04:08:42,416 INFO L226 Difference]: Without dead ends: 717 [2018-02-04 04:08:42,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 04:08:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-02-04 04:08:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 662. [2018-02-04 04:08:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-02-04 04:08:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 768 transitions. [2018-02-04 04:08:42,421 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 768 transitions. Word has length 267 [2018-02-04 04:08:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:42,421 INFO L432 AbstractCegarLoop]: Abstraction has 662 states and 768 transitions. [2018-02-04 04:08:42,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-02-04 04:08:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 768 transitions. [2018-02-04 04:08:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 04:08:42,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:42,422 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:42,422 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash 468719061, now seen corresponding path program 53 times [2018-02-04 04:08:42,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:42,423 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:42,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:42,423 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:42,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:42,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:43,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:43,315 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:43,316 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:08:43,335 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-02-04 04:08:43,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:43,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:44,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:44,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 109 [2018-02-04 04:08:44,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-02-04 04:08:44,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-02-04 04:08:44,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 04:08:44,261 INFO L87 Difference]: Start difference. First operand 662 states and 768 transitions. Second operand 110 states. [2018-02-04 04:08:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:51,211 INFO L93 Difference]: Finished difference Result 730 states and 839 transitions. [2018-02-04 04:08:51,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 04:08:51,212 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 272 [2018-02-04 04:08:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:51,213 INFO L225 Difference]: With dead ends: 730 [2018-02-04 04:08:51,213 INFO L226 Difference]: Without dead ends: 730 [2018-02-04 04:08:51,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5619 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 04:08:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-02-04 04:08:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 674. [2018-02-04 04:08:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-02-04 04:08:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 782 transitions. [2018-02-04 04:08:51,218 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 782 transitions. Word has length 272 [2018-02-04 04:08:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:51,218 INFO L432 AbstractCegarLoop]: Abstraction has 674 states and 782 transitions. [2018-02-04 04:08:51,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-02-04 04:08:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 782 transitions. [2018-02-04 04:08:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 04:08:51,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:51,220 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:51,220 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash 502010558, now seen corresponding path program 54 times [2018-02-04 04:08:51,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:51,220 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:51,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:51,221 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:51,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:51,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:52,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:52,073 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:52,074 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:08:52,091 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-02-04 04:08:52,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:52,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:52,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:52,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 60 [2018-02-04 04:08:52,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 04:08:52,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 04:08:52,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1558, Invalid=2102, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:08:52,259 INFO L87 Difference]: Start difference. First operand 674 states and 782 transitions. Second operand 61 states. [2018-02-04 04:08:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:54,286 INFO L93 Difference]: Finished difference Result 743 states and 854 transitions. [2018-02-04 04:08:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 04:08:54,286 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 277 [2018-02-04 04:08:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:54,288 INFO L225 Difference]: With dead ends: 743 [2018-02-04 04:08:54,288 INFO L226 Difference]: Without dead ends: 743 [2018-02-04 04:08:54,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4742, Invalid=8368, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 04:08:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-02-04 04:08:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 686. [2018-02-04 04:08:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-02-04 04:08:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 796 transitions. [2018-02-04 04:08:54,292 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 796 transitions. Word has length 277 [2018-02-04 04:08:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:54,293 INFO L432 AbstractCegarLoop]: Abstraction has 686 states and 796 transitions. [2018-02-04 04:08:54,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 04:08:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 796 transitions. [2018-02-04 04:08:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-02-04 04:08:54,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:54,294 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:54,294 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:54,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1280917643, now seen corresponding path program 55 times [2018-02-04 04:08:54,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:54,294 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:54,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:54,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:08:54,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:54,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:55,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:55,209 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:55,209 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:55,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:55,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:55,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-02-04 04:08:55,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 04:08:55,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 04:08:55,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:08:55,259 INFO L87 Difference]: Start difference. First operand 686 states and 796 transitions. Second operand 59 states. [2018-02-04 04:08:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:57,110 INFO L93 Difference]: Finished difference Result 756 states and 869 transitions. [2018-02-04 04:08:57,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 04:08:57,110 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-02-04 04:08:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:57,112 INFO L225 Difference]: With dead ends: 756 [2018-02-04 04:08:57,112 INFO L226 Difference]: Without dead ends: 756 [2018-02-04 04:08:57,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 04:08:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-04 04:08:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 698. [2018-02-04 04:08:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-02-04 04:08:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 810 transitions. [2018-02-04 04:08:57,117 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 810 transitions. Word has length 282 [2018-02-04 04:08:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:57,117 INFO L432 AbstractCegarLoop]: Abstraction has 698 states and 810 transitions. [2018-02-04 04:08:57,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 04:08:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 810 transitions. [2018-02-04 04:08:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 04:08:57,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:57,118 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:57,118 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:08:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1543400734, now seen corresponding path program 56 times [2018-02-04 04:08:57,118 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:57,118 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:57,119 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:57,119 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:57,119 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:57,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:57,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:57,980 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:57,980 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:08:57,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:08:57,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:08:57,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:58,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:58,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-02-04 04:08:58,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 04:08:58,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 04:08:58,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:08:58,046 INFO L87 Difference]: Start difference. First operand 698 states and 810 transitions. Second operand 60 states. [2018-02-04 04:09:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:09:00,655 INFO L93 Difference]: Finished difference Result 769 states and 884 transitions. [2018-02-04 04:09:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 04:09:00,656 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-02-04 04:09:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:09:00,657 INFO L225 Difference]: With dead ends: 769 [2018-02-04 04:09:00,657 INFO L226 Difference]: Without dead ends: 769 [2018-02-04 04:09:00,658 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 04:09:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-02-04 04:09:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 710. [2018-02-04 04:09:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-02-04 04:09:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 824 transitions. [2018-02-04 04:09:00,662 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 824 transitions. Word has length 287 [2018-02-04 04:09:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:09:00,662 INFO L432 AbstractCegarLoop]: Abstraction has 710 states and 824 transitions. [2018-02-04 04:09:00,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 04:09:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 824 transitions. [2018-02-04 04:09:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 04:09:00,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:09:00,664 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-04 04:09:00,664 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:09:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1462902507, now seen corresponding path program 57 times [2018-02-04 04:09:00,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:09:00,664 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:09:00,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:00,665 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:09:00,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:09:00,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:09:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:01,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:09:01,764 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:09:01,765 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:09:01,790 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-02-04 04:09:01,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:09:01,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:09:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:02,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:09:02,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 118 [2018-02-04 04:09:02,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-02-04 04:09:02,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-02-04 04:09:02,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 04:09:02,917 INFO L87 Difference]: Start difference. First operand 710 states and 824 transitions. Second operand 119 states. [2018-02-04 04:09:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:09:08,420 INFO L93 Difference]: Finished difference Result 782 states and 899 transitions. [2018-02-04 04:09:08,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 04:09:08,420 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 292 [2018-02-04 04:09:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:09:08,422 INFO L225 Difference]: With dead ends: 782 [2018-02-04 04:09:08,422 INFO L226 Difference]: Without dead ends: 782 [2018-02-04 04:09:08,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6611 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 04:09:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-02-04 04:09:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 722. [2018-02-04 04:09:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-02-04 04:09:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 838 transitions. [2018-02-04 04:09:08,427 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 838 transitions. Word has length 292 [2018-02-04 04:09:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:09:08,427 INFO L432 AbstractCegarLoop]: Abstraction has 722 states and 838 transitions. [2018-02-04 04:09:08,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-02-04 04:09:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 838 transitions. [2018-02-04 04:09:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 04:09:08,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:09:08,428 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-04 04:09:08,428 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:09:08,428 INFO L82 PathProgramCache]: Analyzing trace with hash -399814786, now seen corresponding path program 58 times [2018-02-04 04:09:08,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:09:08,428 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:09:08,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:08,429 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:09:08,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:09:08,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:09:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:09,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:09:09,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:09:09,410 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:09:09,419 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:09:09,419 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:09:09,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:09:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:09,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:09:09,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 66 [2018-02-04 04:09:09,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 04:09:09,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 04:09:09,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1743, Invalid=2679, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 04:09:09,546 INFO L87 Difference]: Start difference. First operand 722 states and 838 transitions. Second operand 67 states. [2018-02-04 04:09:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:09:11,815 INFO L93 Difference]: Finished difference Result 795 states and 914 transitions. [2018-02-04 04:09:11,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 04:09:11,816 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 297 [2018-02-04 04:09:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:09:11,817 INFO L225 Difference]: With dead ends: 795 [2018-02-04 04:09:11,817 INFO L226 Difference]: Without dead ends: 795 [2018-02-04 04:09:11,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5387, Invalid=10113, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 04:09:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-02-04 04:09:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 734. [2018-02-04 04:09:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-02-04 04:09:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2018-02-04 04:09:11,822 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 297 [2018-02-04 04:09:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:09:11,823 INFO L432 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2018-02-04 04:09:11,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 04:09:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2018-02-04 04:09:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-04 04:09:11,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:09:11,824 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-02-04 04:09:11,824 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:09:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash 590314165, now seen corresponding path program 59 times [2018-02-04 04:09:11,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:09:11,824 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:09:11,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:11,824 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:09:11,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:09:11,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:09:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:12,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:09:12,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:09:12,831 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:09:12,852 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-02-04 04:09:12,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:09:12,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:09:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:13,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:09:13,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61] total 121 [2018-02-04 04:09:13,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-02-04 04:09:13,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-02-04 04:09:13,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-02-04 04:09:13,991 INFO L87 Difference]: Start difference. First operand 734 states and 852 transitions. Second operand 122 states. [2018-02-04 04:09:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:09:22,598 INFO L93 Difference]: Finished difference Result 808 states and 929 transitions. [2018-02-04 04:09:22,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 04:09:22,598 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 302 [2018-02-04 04:09:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:09:22,600 INFO L225 Difference]: With dead ends: 808 [2018-02-04 04:09:22,600 INFO L226 Difference]: Without dead ends: 808 [2018-02-04 04:09:22,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6963 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-02-04 04:09:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-02-04 04:09:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 746. [2018-02-04 04:09:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-02-04 04:09:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 866 transitions. [2018-02-04 04:09:22,605 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 866 transitions. Word has length 302 [2018-02-04 04:09:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:09:22,605 INFO L432 AbstractCegarLoop]: Abstraction has 746 states and 866 transitions. [2018-02-04 04:09:22,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-02-04 04:09:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 866 transitions. [2018-02-04 04:09:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 04:09:22,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:09:22,606 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-02-04 04:09:22,606 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:09:22,606 INFO L82 PathProgramCache]: Analyzing trace with hash -387401250, now seen corresponding path program 60 times [2018-02-04 04:09:22,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:09:22,606 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:09:22,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:22,607 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:09:22,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:09:22,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:09:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:23,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:09:23,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:09:23,685 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:09:23,705 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-02-04 04:09:23,705 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:09:23,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:09:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:24,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:09:24,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 120 [2018-02-04 04:09:24,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-02-04 04:09:24,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-02-04 04:09:24,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3548, Invalid=10972, Unknown=0, NotChecked=0, Total=14520 [2018-02-04 04:09:24,809 INFO L87 Difference]: Start difference. First operand 746 states and 866 transitions. Second operand 121 states. [2018-02-04 04:09:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:09:32,352 INFO L93 Difference]: Finished difference Result 821 states and 944 transitions. [2018-02-04 04:09:32,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 04:09:32,352 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 307 [2018-02-04 04:09:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:09:32,354 INFO L225 Difference]: With dead ends: 821 [2018-02-04 04:09:32,354 INFO L226 Difference]: Without dead ends: 821 [2018-02-04 04:09:32,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10577 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5803, Invalid=25349, Unknown=0, NotChecked=0, Total=31152 [2018-02-04 04:09:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-02-04 04:09:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 758. [2018-02-04 04:09:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-02-04 04:09:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 880 transitions. [2018-02-04 04:09:32,359 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 880 transitions. Word has length 307 [2018-02-04 04:09:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:09:32,360 INFO L432 AbstractCegarLoop]: Abstraction has 758 states and 880 transitions. [2018-02-04 04:09:32,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-02-04 04:09:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 880 transitions. [2018-02-04 04:09:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-02-04 04:09:32,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:09:32,361 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-02-04 04:09:32,361 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:09:32,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1776972715, now seen corresponding path program 61 times [2018-02-04 04:09:32,361 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:09:32,361 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:09:32,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:32,361 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:09:32,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:09:32,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:09:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:33,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:09:33,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:09:33,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:09:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:09:33,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:09:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:33,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:09:33,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-02-04 04:09:33,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 04:09:33,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 04:09:33,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:09:33,464 INFO L87 Difference]: Start difference. First operand 758 states and 880 transitions. Second operand 65 states. [2018-02-04 04:09:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:09:35,607 INFO L93 Difference]: Finished difference Result 834 states and 959 transitions. [2018-02-04 04:09:35,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 04:09:35,607 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-02-04 04:09:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:09:35,610 INFO L225 Difference]: With dead ends: 834 [2018-02-04 04:09:35,610 INFO L226 Difference]: Without dead ends: 834 [2018-02-04 04:09:35,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-02-04 04:09:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-02-04 04:09:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 770. [2018-02-04 04:09:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-02-04 04:09:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 894 transitions. [2018-02-04 04:09:35,618 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 894 transitions. Word has length 312 [2018-02-04 04:09:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:09:35,618 INFO L432 AbstractCegarLoop]: Abstraction has 770 states and 894 transitions. [2018-02-04 04:09:35,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 04:09:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 894 transitions. [2018-02-04 04:09:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-02-04 04:09:35,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:09:35,619 INFO L351 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-02-04 04:09:35,619 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:09:35,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1764535358, now seen corresponding path program 62 times [2018-02-04 04:09:35,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:09:35,619 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:09:35,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:35,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:09:35,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:09:35,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:09:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:36,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:09:36,756 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:09:36,757 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:09:36,765 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:09:36,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:09:36,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:09:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:36,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:09:36,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-02-04 04:09:36,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 04:09:36,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 04:09:36,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 04:09:36,831 INFO L87 Difference]: Start difference. First operand 770 states and 894 transitions. Second operand 66 states. [2018-02-04 04:09:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:09:39,169 INFO L93 Difference]: Finished difference Result 847 states and 974 transitions. [2018-02-04 04:09:39,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 04:09:39,169 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-02-04 04:09:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:09:39,171 INFO L225 Difference]: With dead ends: 847 [2018-02-04 04:09:39,171 INFO L226 Difference]: Without dead ends: 847 [2018-02-04 04:09:39,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-02-04 04:09:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-02-04 04:09:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 782. [2018-02-04 04:09:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-02-04 04:09:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 908 transitions. [2018-02-04 04:09:39,178 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 908 transitions. Word has length 317 [2018-02-04 04:09:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:09:39,178 INFO L432 AbstractCegarLoop]: Abstraction has 782 states and 908 transitions. [2018-02-04 04:09:39,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 04:09:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 908 transitions. [2018-02-04 04:09:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-02-04 04:09:39,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:09:39,179 INFO L351 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-02-04 04:09:39,179 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:09:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1615468021, now seen corresponding path program 63 times [2018-02-04 04:09:39,180 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:09:39,180 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:09:39,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:39,180 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:09:39,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:09:39,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:09:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:40,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:09:40,340 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:09:40,340 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:09:40,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-02-04 04:09:40,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:09:40,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:09:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:41,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:09:41,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 130 [2018-02-04 04:09:41,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-02-04 04:09:41,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-02-04 04:09:41,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 04:09:41,436 INFO L87 Difference]: Start difference. First operand 782 states and 908 transitions. Second operand 131 states. [2018-02-04 04:09:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:09:49,209 INFO L93 Difference]: Finished difference Result 860 states and 989 transitions. [2018-02-04 04:09:49,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 04:09:49,210 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 322 [2018-02-04 04:09:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:09:49,212 INFO L225 Difference]: With dead ends: 860 [2018-02-04 04:09:49,212 INFO L226 Difference]: Without dead ends: 860 [2018-02-04 04:09:49,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8063 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 04:09:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-02-04 04:09:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 794. [2018-02-04 04:09:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-02-04 04:09:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 922 transitions. [2018-02-04 04:09:49,219 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 922 transitions. Word has length 322 [2018-02-04 04:09:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:09:49,219 INFO L432 AbstractCegarLoop]: Abstraction has 794 states and 922 transitions. [2018-02-04 04:09:49,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-02-04 04:09:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 922 transitions. [2018-02-04 04:09:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 04:09:49,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:09:49,221 INFO L351 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-02-04 04:09:49,222 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:09:49,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1200806242, now seen corresponding path program 64 times [2018-02-04 04:09:49,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:09:49,222 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:09:49,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:49,223 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:09:49,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:09:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:09:49,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:09:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:50,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:09:50,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:09:50,872 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:09:50,884 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:09:50,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:09:50,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:09:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:09:50,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:09:50,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-02-04 04:09:50,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 04:09:50,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 04:09:50,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 04:09:50,977 INFO L87 Difference]: Start difference. First operand 794 states and 922 transitions. Second operand 67 states. [2018-02-04 04:10:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:10:03,420 INFO L93 Difference]: Finished difference Result 873 states and 1004 transitions. [2018-02-04 04:10:03,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 04:10:03,420 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-02-04 04:10:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:10:03,422 INFO L225 Difference]: With dead ends: 873 [2018-02-04 04:10:03,423 INFO L226 Difference]: Without dead ends: 873 [2018-02-04 04:10:03,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 04:10:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-02-04 04:10:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 806. [2018-02-04 04:10:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-02-04 04:10:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 936 transitions. [2018-02-04 04:10:03,431 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 936 transitions. Word has length 327 [2018-02-04 04:10:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:10:03,432 INFO L432 AbstractCegarLoop]: Abstraction has 806 states and 936 transitions. [2018-02-04 04:10:03,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 04:10:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 936 transitions. [2018-02-04 04:10:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-02-04 04:10:03,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:10:03,433 INFO L351 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-02-04 04:10:03,433 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr5AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:10:03,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1813452693, now seen corresponding path program 65 times [2018-02-04 04:10:03,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:10:03,434 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:10:03,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:03,434 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:10:03,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:10:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:10:03,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:10:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:10:04,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:10:04,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:10:04,664 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:10:04,687 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-02-04 04:10:04,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:10:04,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-02-04 04:10:04,823 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 04:10:04,824 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:10:04,827 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:10:04,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:10:04 BoogieIcfgContainer [2018-02-04 04:10:04,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:10:04,828 INFO L168 Benchmark]: Toolchain (without parser) took 181163.32 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 912.3 MB). Free memory was 357.8 MB in the beginning and 518.6 MB in the end (delta: -160.8 MB). Peak memory consumption was 751.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:10:04,828 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 401.1 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:10:04,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.94 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 349.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:10:04,829 INFO L168 Benchmark]: Boogie Preprocessor took 23.07 ms. Allocated memory is still 401.1 MB. Free memory is still 349.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:10:04,829 INFO L168 Benchmark]: RCFGBuilder took 125.57 ms. Allocated memory is still 401.1 MB. Free memory was 349.8 MB in the beginning and 335.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:10:04,829 INFO L168 Benchmark]: TraceAbstraction took 180871.66 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 912.3 MB). Free memory was 335.3 MB in the beginning and 518.6 MB in the end (delta: -183.3 MB). Peak memory consumption was 729.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:10:04,830 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.19 ms. Allocated memory is still 401.1 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 139.94 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 349.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.07 ms. Allocated memory is still 401.1 MB. Free memory is still 349.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 125.57 ms. Allocated memory is still 401.1 MB. Free memory was 349.8 MB in the beginning and 335.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 180871.66 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 912.3 MB). Free memory was 335.3 MB in the beginning and 518.6 MB in the end (delta: -183.3 MB). Peak memory consumption was 729.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 180.8s OverallTime, 66 OverallIterations, 66 TraceHistogramMax, 135.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6809 SDtfs, 71245 SDslu, 107898 SDs, 0 SdLazy, 412117 SolverSat, 26525 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14436 GetRequests, 10144 SyntacticMatches, 7 SemanticMatches, 4285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93219 ImplicationChecksByTransitivity, 56.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 65 MinimizatonAttempts, 2275 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 41.2s InterpolantComputationTime, 21703 NumberOfCodeBlocks, 21703 NumberOfCodeBlocksAsserted, 1164 NumberOfCheckSat, 21574 ConstructedInterpolants, 0 QuantifiedInterpolants, 17579212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 23776 ConjunctsInSsa, 3103 ConjunctsInUnsatCore, 129 InterpolantComputations, 1 PerfectInterpolantSequences, 0/445120 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-10-04-837.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-10-04-837.csv Completed graceful shutdown