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/sanfoundry_24_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:04:14,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:04:14,245 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:04:14,258 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:04:14,258 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:04:14,259 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:04:14,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:04:14,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:04:14,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:04:14,263 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:04:14,264 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:04:14,264 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:04:14,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:04:14,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:04:14,266 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:04:14,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:04:14,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:04:14,271 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:04:14,272 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:04:14,273 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:04:14,275 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:04:14,275 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:04:14,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:04:14,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:04:14,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:04:14,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:04:14,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:04:14,278 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:04:14,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:04:14,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:04:14,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:04:14,279 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:04:14,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:04:14,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:04:14,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:04:14,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:04:14,289 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:04:14,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:04:14,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:04:14,289 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:04:14,289 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:04:14,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:04:14,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:04:14,290 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:04:14,290 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:04:14,290 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:04:14,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:04:14,290 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:04:14,290 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:04:14,290 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:04:14,290 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:04:14,290 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:04:14,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:04:14,291 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:04:14,291 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:04:14,291 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:04:14,291 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:04:14,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:04:14,326 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:04:14,328 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:04:14,329 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:04:14,330 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:04:14,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_24_false-valid-deref.i [2018-02-04 04:04:14,406 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:04:14,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:04:14,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:04:14,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:04:14,411 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:04:14,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:04:14" (1/1) ... [2018-02-04 04:04:14,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b4b2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14, skipping insertion in model container [2018-02-04 04:04:14,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:04:14" (1/1) ... [2018-02-04 04:04:14,423 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:04:14,434 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:04:14,519 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:04:14,528 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:04:14,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14 WrapperNode [2018-02-04 04:04:14,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:04:14,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:04:14,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:04:14,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:04:14,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14" (1/1) ... [2018-02-04 04:04:14,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14" (1/1) ... [2018-02-04 04:04:14,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14" (1/1) ... [2018-02-04 04:04:14,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14" (1/1) ... [2018-02-04 04:04:14,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14" (1/1) ... [2018-02-04 04:04:14,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14" (1/1) ... [2018-02-04 04:04:14,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14" (1/1) ... [2018-02-04 04:04:14,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:04:14,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:04:14,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:04:14,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:04:14,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14" (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:04:14,603 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:04:14,604 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:04:14,604 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 04:04:14,604 INFO L136 BoogieDeclarations]: Found implementation of procedure printEven [2018-02-04 04:04:14,604 INFO L136 BoogieDeclarations]: Found implementation of procedure printOdd [2018-02-04 04:04:14,604 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:04:14,604 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 04:04:14,604 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 04:04:14,604 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:04:14,605 INFO L128 BoogieDeclarations]: Found specification of procedure printEven [2018-02-04 04:04:14,605 INFO L128 BoogieDeclarations]: Found specification of procedure printOdd [2018-02-04 04:04:14,605 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:04:14,605 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:04:14,605 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:04:14,749 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:04:14,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:04:14 BoogieIcfgContainer [2018-02-04 04:04:14,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:04:14,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:04:14,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:04:14,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:04:14,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:04:14" (1/3) ... [2018-02-04 04:04:14,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a99bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:04:14, skipping insertion in model container [2018-02-04 04:04:14,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:04:14" (2/3) ... [2018-02-04 04:04:14,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a99bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:04:14, skipping insertion in model container [2018-02-04 04:04:14,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:04:14" (3/3) ... [2018-02-04 04:04:14,756 INFO L107 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i [2018-02-04 04:04:14,763 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:04:14,768 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-02-04 04:04:14,802 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:04:14,802 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:04:14,802 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:04:14,803 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:04:14,803 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:04:14,803 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:04:14,803 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:04:14,803 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:04:14,804 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:04:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-02-04 04:04:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 04:04:14,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:14,821 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:14,821 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash 529177341, now seen corresponding path program 1 times [2018-02-04 04:04:14,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:14,826 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:14,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:14,859 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:14,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:14,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:14,941 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:04:14,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:04:14,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:04:14,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:04:14,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:04:14,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:04:14,955 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-02-04 04:04:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:15,042 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-02-04 04:04:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:04:15,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-04 04:04:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:15,050 INFO L225 Difference]: With dead ends: 60 [2018-02-04 04:04:15,050 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 04:04:15,052 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:04:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 04:04:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-04 04:04:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 04:04:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-02-04 04:04:15,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2018-02-04 04:04:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:15,123 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-02-04 04:04:15,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:04:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-02-04 04:04:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 04:04:15,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:15,123 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:15,123 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2078569521, now seen corresponding path program 1 times [2018-02-04 04:04:15,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:15,124 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:15,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:15,124 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:15,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:15,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:15,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:15,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:15,168 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:15,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:15,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:15,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-04 04:04:15,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:04:15,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:04:15,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:04:15,199 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-02-04 04:04:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:15,291 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-02-04 04:04:15,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:04:15,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 04:04:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:15,293 INFO L225 Difference]: With dead ends: 66 [2018-02-04 04:04:15,293 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 04:04:15,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:04:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 04:04:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-02-04 04:04:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 04:04:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-02-04 04:04:15,301 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 13 [2018-02-04 04:04:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:15,301 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-02-04 04:04:15,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:04:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-02-04 04:04:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 04:04:15,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:15,302 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:15,303 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1794788925, now seen corresponding path program 2 times [2018-02-04 04:04:15,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:15,303 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:15,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:15,304 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:15,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:15,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:15,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:15,369 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:15,369 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:15,382 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:15,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:15,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:15,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:15,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-04 04:04:15,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:04:15,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:04:15,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:04:15,392 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 5 states. [2018-02-04 04:04:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:15,552 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-02-04 04:04:15,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:04:15,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 04:04:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:15,555 INFO L225 Difference]: With dead ends: 81 [2018-02-04 04:04:15,555 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 04:04:15,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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:04:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 04:04:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-02-04 04:04:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 04:04:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 04:04:15,563 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 18 [2018-02-04 04:04:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:15,564 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 04:04:15,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:04:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 04:04:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:04:15,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:15,565 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:15,565 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:15,565 INFO L82 PathProgramCache]: Analyzing trace with hash -424025969, now seen corresponding path program 3 times [2018-02-04 04:04:15,566 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:15,566 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:15,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:15,567 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:15,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:15,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:15,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:15,634 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:15,635 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:15,650 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 04:04:15,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:15,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:15,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:15,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-02-04 04:04:15,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:04:15,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:04:15,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:04:15,687 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 11 states. [2018-02-04 04:04:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:15,867 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-02-04 04:04:15,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:04:15,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 04:04:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:15,869 INFO L225 Difference]: With dead ends: 96 [2018-02-04 04:04:15,869 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 04:04:15,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:04:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 04:04:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2018-02-04 04:04:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 04:04:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2018-02-04 04:04:15,876 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 23 [2018-02-04 04:04:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:15,877 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2018-02-04 04:04:15,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:04:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2018-02-04 04:04:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 04:04:15,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:15,878 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:15,878 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:15,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1714228867, now seen corresponding path program 4 times [2018-02-04 04:04:15,879 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:15,879 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:15,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:15,880 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:15,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:15,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:15,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:15,967 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:15,968 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:15,984 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:15,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:15,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:16,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:16,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-02-04 04:04:16,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:04:16,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:04:16,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:04:16,059 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand 13 states. [2018-02-04 04:04:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:16,341 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2018-02-04 04:04:16,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:04:16,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-04 04:04:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:16,343 INFO L225 Difference]: With dead ends: 111 [2018-02-04 04:04:16,343 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 04:04:16,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:04:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 04:04:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2018-02-04 04:04:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 04:04:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2018-02-04 04:04:16,350 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 28 [2018-02-04 04:04:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:16,350 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2018-02-04 04:04:16,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:04:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2018-02-04 04:04:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 04:04:16,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:16,352 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:16,352 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash -771406513, now seen corresponding path program 5 times [2018-02-04 04:04:16,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:16,352 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:16,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,353 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:16,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:16,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:16,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:16,421 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:16,437 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 04:04:16,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:16,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:16,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:16,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-02-04 04:04:16,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:04:16,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:04:16,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:04:16,501 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand 15 states. [2018-02-04 04:04:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:16,815 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2018-02-04 04:04:16,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:04:16,815 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-02-04 04:04:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:16,817 INFO L225 Difference]: With dead ends: 126 [2018-02-04 04:04:16,817 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 04:04:16,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:04:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 04:04:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-02-04 04:04:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 04:04:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2018-02-04 04:04:16,824 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 33 [2018-02-04 04:04:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:16,824 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2018-02-04 04:04:16,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:04:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2018-02-04 04:04:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 04:04:16,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:16,826 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:16,826 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:16,826 INFO L82 PathProgramCache]: Analyzing trace with hash -240614211, now seen corresponding path program 6 times [2018-02-04 04:04:16,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:16,826 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:16,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,827 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:16,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:16,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:16,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:16,906 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:16,907 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:16,925 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 04:04:16,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:16,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:16,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:16,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-02-04 04:04:16,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:04:16,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:04:16,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:04:16,960 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 13 states. [2018-02-04 04:04:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:17,174 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-02-04 04:04:17,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:04:17,174 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-04 04:04:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:17,176 INFO L225 Difference]: With dead ends: 141 [2018-02-04 04:04:17,176 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 04:04:17,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:04:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 04:04:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-02-04 04:04:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 04:04:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2018-02-04 04:04:17,184 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 38 [2018-02-04 04:04:17,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:17,184 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2018-02-04 04:04:17,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:04:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2018-02-04 04:04:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:04:17,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:17,186 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:17,186 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1558821391, now seen corresponding path program 7 times [2018-02-04 04:04:17,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:17,187 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:17,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,188 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:17,188 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:17,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:17,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:17,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:17,291 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:17,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:17,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:17,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 04:04:17,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:04:17,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:04:17,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:04:17,313 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand 11 states. [2018-02-04 04:04:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:17,555 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2018-02-04 04:04:17,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:04:17,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-02-04 04:04:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:17,557 INFO L225 Difference]: With dead ends: 156 [2018-02-04 04:04:17,557 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 04:04:17,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:04:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 04:04:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2018-02-04 04:04:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 04:04:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2018-02-04 04:04:17,563 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 43 [2018-02-04 04:04:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:17,564 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2018-02-04 04:04:17,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:04:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2018-02-04 04:04:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 04:04:17,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:17,565 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:17,565 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:17,566 INFO L82 PathProgramCache]: Analyzing trace with hash -821098499, now seen corresponding path program 8 times [2018-02-04 04:04:17,566 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:17,566 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:17,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,567 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:17,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:17,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:17,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:17,674 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:17,674 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:17,684 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:17,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:17,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:17,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:17,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 04:04:17,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:04:17,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:04:17,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:04:17,710 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand 11 states. [2018-02-04 04:04:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:18,334 INFO L93 Difference]: Finished difference Result 171 states and 220 transitions. [2018-02-04 04:04:18,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:04:18,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 04:04:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:18,335 INFO L225 Difference]: With dead ends: 171 [2018-02-04 04:04:18,335 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 04:04:18,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 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:04:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 04:04:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-02-04 04:04:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 04:04:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2018-02-04 04:04:18,339 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 48 [2018-02-04 04:04:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:18,339 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2018-02-04 04:04:18,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:04:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2018-02-04 04:04:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 04:04:18,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:18,340 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:18,341 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash -413974833, now seen corresponding path program 9 times [2018-02-04 04:04:18,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:18,341 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:18,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,342 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:18,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:18,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:18,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:18,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:18,418 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:18,440 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 04:04:18,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:18,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:18,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:18,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-02-04 04:04:18,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:04:18,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:04:18,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:04:18,453 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand 13 states. [2018-02-04 04:04:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:18,717 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2018-02-04 04:04:18,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:04:18,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-04 04:04:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:18,719 INFO L225 Difference]: With dead ends: 186 [2018-02-04 04:04:18,719 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 04:04:18,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:04:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 04:04:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-02-04 04:04:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 04:04:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2018-02-04 04:04:18,728 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 53 [2018-02-04 04:04:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:18,728 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2018-02-04 04:04:18,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:04:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2018-02-04 04:04:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 04:04:18,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:18,730 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:18,730 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash -442860739, now seen corresponding path program 10 times [2018-02-04 04:04:18,730 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:18,730 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:18,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,734 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:18,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:18,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:18,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:18,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:18,849 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:18,868 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:18,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:18,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:18,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:18,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-02-04 04:04:18,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:04:18,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:04:18,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:04:18,903 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand 17 states. [2018-02-04 04:04:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:19,293 INFO L93 Difference]: Finished difference Result 201 states and 260 transitions. [2018-02-04 04:04:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:04:19,293 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-04 04:04:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:19,294 INFO L225 Difference]: With dead ends: 201 [2018-02-04 04:04:19,294 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 04:04:19,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:04:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 04:04:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2018-02-04 04:04:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 04:04:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-02-04 04:04:19,301 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 58 [2018-02-04 04:04:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:19,301 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-02-04 04:04:19,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:04:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-02-04 04:04:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 04:04:19,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:19,302 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:19,303 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:19,303 INFO L82 PathProgramCache]: Analyzing trace with hash -634530929, now seen corresponding path program 11 times [2018-02-04 04:04:19,303 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:19,303 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:19,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:19,304 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:19,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:19,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:19,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:19,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:19,408 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:19,435 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 04:04:19,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:19,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:19,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:19,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-02-04 04:04:19,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:04:19,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:04:19,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:04:19,563 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 27 states. [2018-02-04 04:04:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:20,573 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2018-02-04 04:04:20,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:04:20,574 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-02-04 04:04:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:20,575 INFO L225 Difference]: With dead ends: 216 [2018-02-04 04:04:20,575 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 04:04:20,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:04:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 04:04:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2018-02-04 04:04:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 04:04:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2018-02-04 04:04:20,581 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 63 [2018-02-04 04:04:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:20,581 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2018-02-04 04:04:20,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:04:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-02-04 04:04:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 04:04:20,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:20,582 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:20,583 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:20,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2145312381, now seen corresponding path program 12 times [2018-02-04 04:04:20,583 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:20,583 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:20,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:20,584 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:20,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:20,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:20,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:20,709 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:20,710 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:20,738 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 04:04:20,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:20,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:20,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:20,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-02-04 04:04:20,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:04:20,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:04:20,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:04:20,874 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand 29 states. [2018-02-04 04:04:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:21,606 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2018-02-04 04:04:21,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:04:21,606 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 68 [2018-02-04 04:04:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:21,607 INFO L225 Difference]: With dead ends: 231 [2018-02-04 04:04:21,607 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 04:04:21,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 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:04:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 04:04:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2018-02-04 04:04:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 04:04:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 281 transitions. [2018-02-04 04:04:21,614 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 281 transitions. Word has length 68 [2018-02-04 04:04:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:21,614 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 281 transitions. [2018-02-04 04:04:21,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:04:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 281 transitions. [2018-02-04 04:04:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 04:04:21,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:21,616 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:21,616 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:21,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1734703183, now seen corresponding path program 13 times [2018-02-04 04:04:21,616 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:21,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:21,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:21,617 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:21,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:21,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:21,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:21,747 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:21,748 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:21,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:21,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:21,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-02-04 04:04:21,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:04:21,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:04:21,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:04:21,781 INFO L87 Difference]: Start difference. First operand 214 states and 281 transitions. Second operand 17 states. [2018-02-04 04:04:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:22,248 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2018-02-04 04:04:22,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:04:22,249 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-02-04 04:04:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:22,250 INFO L225 Difference]: With dead ends: 246 [2018-02-04 04:04:22,250 INFO L226 Difference]: Without dead ends: 246 [2018-02-04 04:04:22,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:04:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-04 04:04:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2018-02-04 04:04:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 04:04:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 300 transitions. [2018-02-04 04:04:22,256 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 300 transitions. Word has length 73 [2018-02-04 04:04:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:22,257 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 300 transitions. [2018-02-04 04:04:22,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:04:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2018-02-04 04:04:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 04:04:22,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:22,259 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:22,259 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1083166275, now seen corresponding path program 14 times [2018-02-04 04:04:22,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:22,259 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:22,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:22,260 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:22,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:22,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:22,383 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:22,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:22,383 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:22,391 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:22,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:22,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:22,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:22,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-02-04 04:04:22,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:04:22,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:04:22,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:04:22,443 INFO L87 Difference]: Start difference. First operand 228 states and 300 transitions. Second operand 22 states. [2018-02-04 04:04:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:22,947 INFO L93 Difference]: Finished difference Result 261 states and 340 transitions. [2018-02-04 04:04:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:04:22,947 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2018-02-04 04:04:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:22,948 INFO L225 Difference]: With dead ends: 261 [2018-02-04 04:04:22,948 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 04:04:22,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=388, Invalid=872, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:04:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 04:04:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 242. [2018-02-04 04:04:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 04:04:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-02-04 04:04:22,952 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 78 [2018-02-04 04:04:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:22,953 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-02-04 04:04:22,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:04:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-02-04 04:04:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 04:04:22,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:22,954 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:22,954 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1239821583, now seen corresponding path program 15 times [2018-02-04 04:04:22,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:22,955 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:22,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:22,955 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:22,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:22,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:23,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:23,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:23,112 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:23,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 04:04:23,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:23,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:23,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:23,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-04 04:04:23,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:04:23,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:04:23,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:04:23,305 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 35 states. [2018-02-04 04:04:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:24,599 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2018-02-04 04:04:24,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 04:04:24,599 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 83 [2018-02-04 04:04:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:24,600 INFO L225 Difference]: With dead ends: 276 [2018-02-04 04:04:24,600 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 04:04:24,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:04:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 04:04:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2018-02-04 04:04:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 04:04:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 338 transitions. [2018-02-04 04:04:24,604 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 338 transitions. Word has length 83 [2018-02-04 04:04:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:24,604 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 338 transitions. [2018-02-04 04:04:24,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:04:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 338 transitions. [2018-02-04 04:04:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 04:04:24,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:24,605 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:24,605 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:24,605 INFO L82 PathProgramCache]: Analyzing trace with hash -589138691, now seen corresponding path program 16 times [2018-02-04 04:04:24,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:24,605 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:24,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:24,606 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:24,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:24,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:24,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:24,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:24,760 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:24,774 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:24,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:24,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:25,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:25,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2018-02-04 04:04:25,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:04:25,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:04:25,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:04:25,046 INFO L87 Difference]: Start difference. First operand 256 states and 338 transitions. Second operand 37 states. [2018-02-04 04:04:26,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:26,198 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2018-02-04 04:04:26,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:04:26,198 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 88 [2018-02-04 04:04:26,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:26,199 INFO L225 Difference]: With dead ends: 291 [2018-02-04 04:04:26,199 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 04:04:26,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:04:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 04:04:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2018-02-04 04:04:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 04:04:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2018-02-04 04:04:26,203 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 88 [2018-02-04 04:04:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:26,203 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2018-02-04 04:04:26,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:04:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2018-02-04 04:04:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 04:04:26,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:26,204 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:26,204 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2053377585, now seen corresponding path program 17 times [2018-02-04 04:04:26,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:26,204 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:26,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:26,205 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:26,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:26,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:04:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:26,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:26,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:26,341 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:26,361 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 04:04:26,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:26,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:26,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:26,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-02-04 04:04:26,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 04:04:26,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 04:04:26,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:04:26,541 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand 39 states. [2018-02-04 04:04:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:28,389 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2018-02-04 04:04:28,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:04:28,389 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 93 [2018-02-04 04:04:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:28,390 INFO L225 Difference]: With dead ends: 306 [2018-02-04 04:04:28,390 INFO L226 Difference]: Without dead ends: 306 [2018-02-04 04:04:28,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:04:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-04 04:04:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 284. [2018-02-04 04:04:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 04:04:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 376 transitions. [2018-02-04 04:04:28,396 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 376 transitions. Word has length 93 [2018-02-04 04:04:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:28,397 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 376 transitions. [2018-02-04 04:04:28,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 04:04:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 376 transitions. [2018-02-04 04:04:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 04:04:28,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:28,398 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:28,398 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1741269053, now seen corresponding path program 18 times [2018-02-04 04:04:28,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:28,399 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:28,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:28,400 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:28,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:28,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:28,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:28,574 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:28,575 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:28,597 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 04:04:28,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:28,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:28,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:28,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-04 04:04:28,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:04:28,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:04:28,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:04:28,821 INFO L87 Difference]: Start difference. First operand 284 states and 376 transitions. Second operand 41 states. [2018-02-04 04:04:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:30,358 INFO L93 Difference]: Finished difference Result 321 states and 420 transitions. [2018-02-04 04:04:30,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:04:30,358 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 98 [2018-02-04 04:04:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:30,359 INFO L225 Difference]: With dead ends: 321 [2018-02-04 04:04:30,359 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 04:04:30,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:04:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 04:04:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-02-04 04:04:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-04 04:04:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2018-02-04 04:04:30,364 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 98 [2018-02-04 04:04:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:30,364 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2018-02-04 04:04:30,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:04:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2018-02-04 04:04:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 04:04:30,365 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:30,365 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:30,365 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:30,365 INFO L82 PathProgramCache]: Analyzing trace with hash 661833359, now seen corresponding path program 19 times [2018-02-04 04:04:30,365 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:30,365 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:30,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:30,365 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:30,366 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:30,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:30,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:30,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:30,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:30,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:30,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:30,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-02-04 04:04:30,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:04:30,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:04:30,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:04:30,572 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand 23 states. [2018-02-04 04:04:31,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:31,092 INFO L93 Difference]: Finished difference Result 336 states and 440 transitions. [2018-02-04 04:04:31,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:04:31,092 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 103 [2018-02-04 04:04:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:31,094 INFO L225 Difference]: With dead ends: 336 [2018-02-04 04:04:31,094 INFO L226 Difference]: Without dead ends: 336 [2018-02-04 04:04:31,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 103 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:04:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-04 04:04:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 312. [2018-02-04 04:04:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-04 04:04:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 414 transitions. [2018-02-04 04:04:31,098 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 414 transitions. Word has length 103 [2018-02-04 04:04:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:31,098 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 414 transitions. [2018-02-04 04:04:31,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:04:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 414 transitions. [2018-02-04 04:04:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 04:04:31,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:31,099 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:31,099 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2034644099, now seen corresponding path program 20 times [2018-02-04 04:04:31,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:31,099 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:31,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:31,100 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:31,100 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:31,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:31,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:31,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:31,306 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:31,317 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:31,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:31,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:31,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:31,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 28 [2018-02-04 04:04:31,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:04:31,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:04:31,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:04:31,422 INFO L87 Difference]: Start difference. First operand 312 states and 414 transitions. Second operand 29 states. [2018-02-04 04:04:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:32,109 INFO L93 Difference]: Finished difference Result 351 states and 460 transitions. [2018-02-04 04:04:32,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:04:32,109 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2018-02-04 04:04:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:32,110 INFO L225 Difference]: With dead ends: 351 [2018-02-04 04:04:32,110 INFO L226 Difference]: Without dead ends: 351 [2018-02-04 04:04:32,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=757, Invalid=1595, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:04:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-04 04:04:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 326. [2018-02-04 04:04:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 04:04:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2018-02-04 04:04:32,115 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 108 [2018-02-04 04:04:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:32,115 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2018-02-04 04:04:32,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:04:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2018-02-04 04:04:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 04:04:32,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:32,116 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:32,116 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:32,116 INFO L82 PathProgramCache]: Analyzing trace with hash 89566031, now seen corresponding path program 21 times [2018-02-04 04:04:32,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:32,116 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:32,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:32,117 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:32,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:32,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:04:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:32,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:32,317 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:32,317 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:32,335 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 04:04:32,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:32,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:32,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:32,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2018-02-04 04:04:32,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 04:04:32,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 04:04:32,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:04:32,661 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand 47 states. [2018-02-04 04:04:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:34,593 INFO L93 Difference]: Finished difference Result 366 states and 480 transitions. [2018-02-04 04:04:34,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 04:04:34,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 113 [2018-02-04 04:04:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:34,595 INFO L225 Difference]: With dead ends: 366 [2018-02-04 04:04:34,595 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 04:04:34,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:04:34,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 04:04:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2018-02-04 04:04:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-04 04:04:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 452 transitions. [2018-02-04 04:04:34,599 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 452 transitions. Word has length 113 [2018-02-04 04:04:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:34,599 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 452 transitions. [2018-02-04 04:04:34,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 04:04:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 452 transitions. [2018-02-04 04:04:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 04:04:34,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:34,600 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:34,600 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:34,601 INFO L82 PathProgramCache]: Analyzing trace with hash 927391421, now seen corresponding path program 22 times [2018-02-04 04:04:34,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:34,601 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:34,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:34,601 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:34,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:34,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:34,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:34,864 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:34,865 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:34,890 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:34,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:34,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:34,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:34,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 28 [2018-02-04 04:04:34,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:04:34,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:04:34,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=518, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:04:34,956 INFO L87 Difference]: Start difference. First operand 340 states and 452 transitions. Second operand 29 states. [2018-02-04 04:04:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:35,727 INFO L93 Difference]: Finished difference Result 381 states and 500 transitions. [2018-02-04 04:04:35,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:04:35,728 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-02-04 04:04:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:35,729 INFO L225 Difference]: With dead ends: 381 [2018-02-04 04:04:35,729 INFO L226 Difference]: Without dead ends: 381 [2018-02-04 04:04:35,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=886, Invalid=1664, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:04:35,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-04 04:04:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 354. [2018-02-04 04:04:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 04:04:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-02-04 04:04:35,733 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 118 [2018-02-04 04:04:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:35,733 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-02-04 04:04:35,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:04:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-02-04 04:04:35,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-04 04:04:35,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:35,734 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:35,734 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2117312527, now seen corresponding path program 23 times [2018-02-04 04:04:35,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:35,734 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:35,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:35,735 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:35,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:35,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:35,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:35,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:35,961 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:35,984 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 04:04:35,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:35,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:36,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:36,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-02-04 04:04:36,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 04:04:36,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 04:04:36,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:04:36,339 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 51 states. [2018-02-04 04:04:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:38,841 INFO L93 Difference]: Finished difference Result 396 states and 520 transitions. [2018-02-04 04:04:38,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:04:38,841 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 123 [2018-02-04 04:04:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:38,842 INFO L225 Difference]: With dead ends: 396 [2018-02-04 04:04:38,842 INFO L226 Difference]: Without dead ends: 396 [2018-02-04 04:04:38,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:04:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-04 04:04:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 368. [2018-02-04 04:04:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 04:04:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2018-02-04 04:04:38,849 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 123 [2018-02-04 04:04:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:38,850 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2018-02-04 04:04:38,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 04:04:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2018-02-04 04:04:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 04:04:38,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:38,851 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:38,851 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1912282627, now seen corresponding path program 24 times [2018-02-04 04:04:38,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:38,852 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:38,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:38,852 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:38,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:38,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:39,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:39,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:39,070 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:39,098 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 04:04:39,098 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:39,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:39,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:39,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2018-02-04 04:04:39,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:04:39,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:04:39,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:04:39,458 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand 53 states. [2018-02-04 04:04:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:42,027 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2018-02-04 04:04:42,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:04:42,027 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 128 [2018-02-04 04:04:42,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:42,028 INFO L225 Difference]: With dead ends: 411 [2018-02-04 04:04:42,028 INFO L226 Difference]: Without dead ends: 411 [2018-02-04 04:04:42,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:04:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-04 04:04:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 382. [2018-02-04 04:04:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 04:04:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 509 transitions. [2018-02-04 04:04:42,034 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 509 transitions. Word has length 128 [2018-02-04 04:04:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:42,035 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 509 transitions. [2018-02-04 04:04:42,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:04:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 509 transitions. [2018-02-04 04:04:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-04 04:04:42,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:42,036 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:42,036 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:42,037 INFO L82 PathProgramCache]: Analyzing trace with hash 972399823, now seen corresponding path program 25 times [2018-02-04 04:04:42,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:42,037 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:42,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:42,037 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:42,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:42,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:42,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:42,320 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:42,321 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:42,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:42,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:42,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-02-04 04:04:42,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:04:42,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:04:42,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:04:42,359 INFO L87 Difference]: Start difference. First operand 382 states and 509 transitions. Second operand 29 states. [2018-02-04 04:04:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:43,009 INFO L93 Difference]: Finished difference Result 426 states and 560 transitions. [2018-02-04 04:04:43,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 04:04:43,010 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-02-04 04:04:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:43,011 INFO L225 Difference]: With dead ends: 426 [2018-02-04 04:04:43,011 INFO L226 Difference]: Without dead ends: 426 [2018-02-04 04:04:43,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 133 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:04:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-04 04:04:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2018-02-04 04:04:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 04:04:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 528 transitions. [2018-02-04 04:04:43,015 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 528 transitions. Word has length 133 [2018-02-04 04:04:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:43,015 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 528 transitions. [2018-02-04 04:04:43,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:04:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 528 transitions. [2018-02-04 04:04:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-02-04 04:04:43,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:43,016 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:43,016 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash -158870211, now seen corresponding path program 26 times [2018-02-04 04:04:43,016 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:43,016 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:43,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:43,017 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:43,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:43,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:43,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:43,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:43,297 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:04:43,306 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:04:43,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:43,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:43,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:43,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 34 [2018-02-04 04:04:43,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:04:43,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:04:43,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=807, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:04:43,394 INFO L87 Difference]: Start difference. First operand 396 states and 528 transitions. Second operand 35 states. [2018-02-04 04:04:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:44,320 INFO L93 Difference]: Finished difference Result 441 states and 580 transitions. [2018-02-04 04:04:44,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:04:44,320 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2018-02-04 04:04:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:44,321 INFO L225 Difference]: With dead ends: 441 [2018-02-04 04:04:44,321 INFO L226 Difference]: Without dead ends: 441 [2018-02-04 04:04:44,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1179, Invalid=2481, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 04:04:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-04 04:04:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2018-02-04 04:04:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 04:04:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 547 transitions. [2018-02-04 04:04:44,327 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 547 transitions. Word has length 138 [2018-02-04 04:04:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:44,328 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 547 transitions. [2018-02-04 04:04:44,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:04:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 547 transitions. [2018-02-04 04:04:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-04 04:04:44,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:44,329 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:44,329 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash -376915569, now seen corresponding path program 27 times [2018-02-04 04:04:44,330 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:44,330 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:44,330 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:44,330 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:44,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:44,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:44,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:44,683 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:44,684 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:04:44,708 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 04:04:44,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:44,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:44,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:44,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-02-04 04:04:44,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 04:04:44,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 04:04:44,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:04:44,971 INFO L87 Difference]: Start difference. First operand 410 states and 547 transitions. Second operand 59 states. [2018-02-04 04:04:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:48,605 INFO L93 Difference]: Finished difference Result 456 states and 600 transitions. [2018-02-04 04:04:48,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 04:04:48,606 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 143 [2018-02-04 04:04:48,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:48,607 INFO L225 Difference]: With dead ends: 456 [2018-02-04 04:04:48,607 INFO L226 Difference]: Without dead ends: 456 [2018-02-04 04:04:48,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:04:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-04 04:04:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 424. [2018-02-04 04:04:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-04 04:04:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 566 transitions. [2018-02-04 04:04:48,611 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 566 transitions. Word has length 143 [2018-02-04 04:04:48,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:48,611 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 566 transitions. [2018-02-04 04:04:48,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 04:04:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 566 transitions. [2018-02-04 04:04:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 04:04:48,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:48,612 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:48,612 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:48,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1935915133, now seen corresponding path program 28 times [2018-02-04 04:04:48,612 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:48,612 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:48,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:48,613 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:48,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:48,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:04:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:48,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:48,869 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:48,869 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:04:48,893 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:04:48,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:48,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:49,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:49,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 36 [2018-02-04 04:04:49,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 04:04:49,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 04:04:49,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=864, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:04:49,001 INFO L87 Difference]: Start difference. First operand 424 states and 566 transitions. Second operand 37 states. [2018-02-04 04:04:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:50,033 INFO L93 Difference]: Finished difference Result 471 states and 620 transitions. [2018-02-04 04:04:50,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:04:50,034 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 148 [2018-02-04 04:04:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:50,035 INFO L225 Difference]: With dead ends: 471 [2018-02-04 04:04:50,035 INFO L226 Difference]: Without dead ends: 471 [2018-02-04 04:04:50,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1385, Invalid=2775, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:04:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-02-04 04:04:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 438. [2018-02-04 04:04:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-04 04:04:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-02-04 04:04:50,039 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 148 [2018-02-04 04:04:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:50,039 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-02-04 04:04:50,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 04:04:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-02-04 04:04:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 04:04:50,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:50,040 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:50,040 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash 114875983, now seen corresponding path program 29 times [2018-02-04 04:04:50,040 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:50,041 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:50,041 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:50,041 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:50,041 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:50,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:50,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:50,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:50,314 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:04:50,355 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 04:04:50,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:50,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:50,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:50,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2018-02-04 04:04:50,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 04:04:50,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 04:04:50,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:04:50,699 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 63 states. [2018-02-04 04:04:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:55,500 INFO L93 Difference]: Finished difference Result 486 states and 640 transitions. [2018-02-04 04:04:55,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:04:55,500 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 153 [2018-02-04 04:04:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:55,501 INFO L225 Difference]: With dead ends: 486 [2018-02-04 04:04:55,501 INFO L226 Difference]: Without dead ends: 486 [2018-02-04 04:04:55,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:04:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-02-04 04:04:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 452. [2018-02-04 04:04:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 04:04:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 604 transitions. [2018-02-04 04:04:55,506 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 604 transitions. Word has length 153 [2018-02-04 04:04:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:55,506 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 604 transitions. [2018-02-04 04:04:55,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 04:04:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 604 transitions. [2018-02-04 04:04:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-04 04:04:55,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:55,507 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:55,507 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash -567505987, now seen corresponding path program 30 times [2018-02-04 04:04:55,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:55,507 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:55,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:55,508 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:55,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:55,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:55,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:55,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:55,920 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:04:55,947 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 04:04:55,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:04:55,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:56,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:56,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 64 [2018-02-04 04:04:56,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 04:04:56,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 04:04:56,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=3104, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:04:56,366 INFO L87 Difference]: Start difference. First operand 452 states and 604 transitions. Second operand 65 states. [2018-02-04 04:04:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:04:59,134 INFO L93 Difference]: Finished difference Result 501 states and 660 transitions. [2018-02-04 04:04:59,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 04:04:59,134 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 158 [2018-02-04 04:04:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:04:59,135 INFO L225 Difference]: With dead ends: 501 [2018-02-04 04:04:59,135 INFO L226 Difference]: Without dead ends: 501 [2018-02-04 04:04:59,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1056, Invalid=3104, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:04:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-02-04 04:04:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 466. [2018-02-04 04:04:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-02-04 04:04:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2018-02-04 04:04:59,140 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 623 transitions. Word has length 158 [2018-02-04 04:04:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:04:59,140 INFO L432 AbstractCegarLoop]: Abstraction has 466 states and 623 transitions. [2018-02-04 04:04:59,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 04:04:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 623 transitions. [2018-02-04 04:04:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-04 04:04:59,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:04:59,141 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 04:04:59,141 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:04:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1798171889, now seen corresponding path program 31 times [2018-02-04 04:04:59,141 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:04:59,141 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:04:59,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:59,142 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:04:59,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:04:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:59,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:04:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:59,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:04:59,490 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:04:59,491 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:04:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:04:59,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:04:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:04:59,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:04:59,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 04:04:59,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:04:59,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:04:59,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:04:59,538 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand 35 states. [2018-02-04 04:05:00,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:00,519 INFO L93 Difference]: Finished difference Result 516 states and 680 transitions. [2018-02-04 04:05:00,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 04:05:00,519 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2018-02-04 04:05:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:00,521 INFO L225 Difference]: With dead ends: 516 [2018-02-04 04:05:00,521 INFO L226 Difference]: Without dead ends: 516 [2018-02-04 04:05:00,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 163 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:05:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-04 04:05:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 480. [2018-02-04 04:05:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-02-04 04:05:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 642 transitions. [2018-02-04 04:05:00,525 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 642 transitions. Word has length 163 [2018-02-04 04:05:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:00,526 INFO L432 AbstractCegarLoop]: Abstraction has 480 states and 642 transitions. [2018-02-04 04:05:00,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:05:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 642 transitions. [2018-02-04 04:05:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-04 04:05:00,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:00,527 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:00,527 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash 662064893, now seen corresponding path program 32 times [2018-02-04 04:05:00,528 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:00,528 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:00,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:00,528 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:05:00,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:00,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:01,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:01,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:01,037 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:05:01,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:05:01,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:01,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:01,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:01,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 04:05:01,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:05:01,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:05:01,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:05:01,095 INFO L87 Difference]: Start difference. First operand 480 states and 642 transitions. Second operand 35 states. [2018-02-04 04:05:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:06,189 INFO L93 Difference]: Finished difference Result 531 states and 700 transitions. [2018-02-04 04:05:06,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:05:06,189 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 168 [2018-02-04 04:05:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:06,190 INFO L225 Difference]: With dead ends: 531 [2018-02-04 04:05:06,190 INFO L226 Difference]: Without dead ends: 531 [2018-02-04 04:05:06,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:05:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-04 04:05:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 494. [2018-02-04 04:05:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-04 04:05:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 661 transitions. [2018-02-04 04:05:06,194 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 661 transitions. Word has length 168 [2018-02-04 04:05:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:06,194 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 661 transitions. [2018-02-04 04:05:06,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:05:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 661 transitions. [2018-02-04 04:05:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-04 04:05:06,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:06,195 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:06,195 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash -547334193, now seen corresponding path program 33 times [2018-02-04 04:05:06,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:06,195 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:06,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:06,196 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:06,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:06,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:06,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:06,574 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:06,574 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:05:06,605 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 04:05:06,605 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:06,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:06,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:06,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 70 [2018-02-04 04:05:06,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 04:05:06,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 04:05:06,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 04:05:06,997 INFO L87 Difference]: Start difference. First operand 494 states and 661 transitions. Second operand 71 states. [2018-02-04 04:05:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:11,641 INFO L93 Difference]: Finished difference Result 546 states and 720 transitions. [2018-02-04 04:05:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 04:05:11,642 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 173 [2018-02-04 04:05:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:11,643 INFO L225 Difference]: With dead ends: 546 [2018-02-04 04:05:11,643 INFO L226 Difference]: Without dead ends: 546 [2018-02-04 04:05:11,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 04:05:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-04 04:05:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 508. [2018-02-04 04:05:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-04 04:05:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 680 transitions. [2018-02-04 04:05:11,650 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 680 transitions. Word has length 173 [2018-02-04 04:05:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:11,651 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 680 transitions. [2018-02-04 04:05:11,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 04:05:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 680 transitions. [2018-02-04 04:05:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-04 04:05:11,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:11,652 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:11,652 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:11,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1764425155, now seen corresponding path program 34 times [2018-02-04 04:05:11,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:11,653 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:11,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:11,653 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:11,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:11,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:12,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:12,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:12,106 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:05:12,134 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:05:12,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:12,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:12,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:12,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 40 [2018-02-04 04:05:12,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:05:12,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:05:12,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=992, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:05:12,235 INFO L87 Difference]: Start difference. First operand 508 states and 680 transitions. Second operand 41 states. [2018-02-04 04:05:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:13,664 INFO L93 Difference]: Finished difference Result 561 states and 740 transitions. [2018-02-04 04:05:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 04:05:13,664 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-02-04 04:05:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:13,666 INFO L225 Difference]: With dead ends: 561 [2018-02-04 04:05:13,666 INFO L226 Difference]: Without dead ends: 561 [2018-02-04 04:05:13,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1972, Invalid=3578, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 04:05:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-04 04:05:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 522. [2018-02-04 04:05:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-02-04 04:05:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 699 transitions. [2018-02-04 04:05:13,671 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 699 transitions. Word has length 178 [2018-02-04 04:05:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:13,671 INFO L432 AbstractCegarLoop]: Abstraction has 522 states and 699 transitions. [2018-02-04 04:05:13,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:05:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2018-02-04 04:05:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 04:05:13,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:13,672 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:13,672 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:13,673 INFO L82 PathProgramCache]: Analyzing trace with hash 997174415, now seen corresponding path program 35 times [2018-02-04 04:05:13,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:13,673 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:13,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:13,674 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:13,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:13,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:14,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:14,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:14,071 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:05:14,123 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 04:05:14,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:14,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:14,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:14,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-02-04 04:05:14,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 04:05:14,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 04:05:14,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 04:05:14,704 INFO L87 Difference]: Start difference. First operand 522 states and 699 transitions. Second operand 75 states. [2018-02-04 04:05:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:21,443 INFO L93 Difference]: Finished difference Result 576 states and 760 transitions. [2018-02-04 04:05:21,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:05:21,444 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 183 [2018-02-04 04:05:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:21,445 INFO L225 Difference]: With dead ends: 576 [2018-02-04 04:05:21,445 INFO L226 Difference]: Without dead ends: 576 [2018-02-04 04:05:21,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 04:05:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-02-04 04:05:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 536. [2018-02-04 04:05:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-02-04 04:05:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 718 transitions. [2018-02-04 04:05:21,449 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 718 transitions. Word has length 183 [2018-02-04 04:05:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:21,449 INFO L432 AbstractCegarLoop]: Abstraction has 536 states and 718 transitions. [2018-02-04 04:05:21,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 04:05:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2018-02-04 04:05:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 04:05:21,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:21,450 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:21,450 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash 182232445, now seen corresponding path program 36 times [2018-02-04 04:05:21,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:21,451 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:21,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:21,451 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:21,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:21,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:21,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:21,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:21,943 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:05:21,985 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 04:05:21,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:21,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:22,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:22,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38] total 76 [2018-02-04 04:05:22,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 04:05:22,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 04:05:22,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1406, Invalid=4446, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 04:05:22,508 INFO L87 Difference]: Start difference. First operand 536 states and 718 transitions. Second operand 77 states. [2018-02-04 04:05:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:27,040 INFO L93 Difference]: Finished difference Result 591 states and 780 transitions. [2018-02-04 04:05:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:05:27,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 188 [2018-02-04 04:05:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:27,042 INFO L225 Difference]: With dead ends: 591 [2018-02-04 04:05:27,042 INFO L226 Difference]: Without dead ends: 591 [2018-02-04 04:05:27,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1406, Invalid=4446, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 04:05:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-02-04 04:05:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 550. [2018-02-04 04:05:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-04 04:05:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 737 transitions. [2018-02-04 04:05:27,047 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 737 transitions. Word has length 188 [2018-02-04 04:05:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:27,047 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 737 transitions. [2018-02-04 04:05:27,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 04:05:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 737 transitions. [2018-02-04 04:05:27,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 04:05:27,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:27,048 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:27,049 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:27,049 INFO L82 PathProgramCache]: Analyzing trace with hash -957607601, now seen corresponding path program 37 times [2018-02-04 04:05:27,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:27,049 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:27,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:27,049 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:27,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:27,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:27,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:27,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:27,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:05:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:27,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:27,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:27,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-02-04 04:05:27,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:05:27,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:05:27,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:05:27,525 INFO L87 Difference]: Start difference. First operand 550 states and 737 transitions. Second operand 41 states. [2018-02-04 04:05:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:28,846 INFO L93 Difference]: Finished difference Result 606 states and 800 transitions. [2018-02-04 04:05:28,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 04:05:28,846 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 193 [2018-02-04 04:05:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:28,847 INFO L225 Difference]: With dead ends: 606 [2018-02-04 04:05:28,848 INFO L226 Difference]: Without dead ends: 606 [2018-02-04 04:05:28,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 04:05:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-02-04 04:05:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 564. [2018-02-04 04:05:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-02-04 04:05:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 756 transitions. [2018-02-04 04:05:28,853 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 756 transitions. Word has length 193 [2018-02-04 04:05:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:28,853 INFO L432 AbstractCegarLoop]: Abstraction has 564 states and 756 transitions. [2018-02-04 04:05:28,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:05:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 756 transitions. [2018-02-04 04:05:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-04 04:05:28,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:28,855 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:28,855 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash 958478525, now seen corresponding path program 38 times [2018-02-04 04:05:28,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:28,855 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:28,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:28,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:05:28,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:28,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:29,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:29,465 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:29,466 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:05:29,489 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:05:29,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:29,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:29,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:29,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 80 [2018-02-04 04:05:29,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 04:05:29,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 04:05:29,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1640, Invalid=4840, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 04:05:29,963 INFO L87 Difference]: Start difference. First operand 564 states and 756 transitions. Second operand 81 states. [2018-02-04 04:05:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:36,464 INFO L93 Difference]: Finished difference Result 621 states and 820 transitions. [2018-02-04 04:05:36,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 04:05:36,464 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 198 [2018-02-04 04:05:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:36,465 INFO L225 Difference]: With dead ends: 621 [2018-02-04 04:05:36,465 INFO L226 Difference]: Without dead ends: 621 [2018-02-04 04:05:36,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2923 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1640, Invalid=4840, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 04:05:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-02-04 04:05:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 578. [2018-02-04 04:05:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-04 04:05:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 775 transitions. [2018-02-04 04:05:36,470 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 775 transitions. Word has length 198 [2018-02-04 04:05:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:36,470 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 775 transitions. [2018-02-04 04:05:36,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 04:05:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 775 transitions. [2018-02-04 04:05:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-02-04 04:05:36,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:36,471 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:36,471 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash 683771407, now seen corresponding path program 39 times [2018-02-04 04:05:36,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:36,471 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:36,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:36,472 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:36,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:36,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:37,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:37,006 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:37,006 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:05:37,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 04:05:37,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:37,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:37,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:37,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 82 [2018-02-04 04:05:37,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-02-04 04:05:37,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-02-04 04:05:37,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 04:05:37,471 INFO L87 Difference]: Start difference. First operand 578 states and 775 transitions. Second operand 83 states. [2018-02-04 04:05:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:43,111 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2018-02-04 04:05:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 04:05:43,111 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 203 [2018-02-04 04:05:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:43,113 INFO L225 Difference]: With dead ends: 636 [2018-02-04 04:05:43,113 INFO L226 Difference]: Without dead ends: 636 [2018-02-04 04:05:43,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 04:05:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-02-04 04:05:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 592. [2018-02-04 04:05:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-02-04 04:05:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 794 transitions. [2018-02-04 04:05:43,118 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 794 transitions. Word has length 203 [2018-02-04 04:05:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:43,118 INFO L432 AbstractCegarLoop]: Abstraction has 592 states and 794 transitions. [2018-02-04 04:05:43,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-02-04 04:05:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 794 transitions. [2018-02-04 04:05:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-04 04:05:43,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:43,119 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:43,119 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash -298402819, now seen corresponding path program 40 times [2018-02-04 04:05:43,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:43,119 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:43,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:43,120 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:43,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:43,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:43,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:43,865 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:43,865 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:05:43,909 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:05:43,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:43,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:44,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:44,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 52 [2018-02-04 04:05:44,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:05:44,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:05:44,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:05:44,115 INFO L87 Difference]: Start difference. First operand 592 states and 794 transitions. Second operand 53 states. [2018-02-04 04:05:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:46,233 INFO L93 Difference]: Finished difference Result 651 states and 860 transitions. [2018-02-04 04:05:46,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 04:05:46,233 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 208 [2018-02-04 04:05:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:46,235 INFO L225 Difference]: With dead ends: 651 [2018-02-04 04:05:46,235 INFO L226 Difference]: Without dead ends: 651 [2018-02-04 04:05:46,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2707, Invalid=5849, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 04:05:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-02-04 04:05:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 606. [2018-02-04 04:05:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-02-04 04:05:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 813 transitions. [2018-02-04 04:05:46,240 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 813 transitions. Word has length 208 [2018-02-04 04:05:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:46,240 INFO L432 AbstractCegarLoop]: Abstraction has 606 states and 813 transitions. [2018-02-04 04:05:46,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:05:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 813 transitions. [2018-02-04 04:05:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-04 04:05:46,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:46,241 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:46,241 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1356597967, now seen corresponding path program 41 times [2018-02-04 04:05:46,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:46,242 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:46,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:46,242 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:46,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:46,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:05:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:46,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:46,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:46,714 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:05:46,769 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 04:05:46,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:46,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:47,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:47,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2018-02-04 04:05:47,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-02-04 04:05:47,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-02-04 04:05:47,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 04:05:47,468 INFO L87 Difference]: Start difference. First operand 606 states and 813 transitions. Second operand 87 states. [2018-02-04 04:05:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:05:54,279 INFO L93 Difference]: Finished difference Result 666 states and 880 transitions. [2018-02-04 04:05:54,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 04:05:54,280 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 213 [2018-02-04 04:05:54,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:05:54,281 INFO L225 Difference]: With dead ends: 666 [2018-02-04 04:05:54,281 INFO L226 Difference]: Without dead ends: 666 [2018-02-04 04:05:54,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3443 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 04:05:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-02-04 04:05:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 620. [2018-02-04 04:05:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-04 04:05:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 832 transitions. [2018-02-04 04:05:54,286 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 832 transitions. Word has length 213 [2018-02-04 04:05:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:05:54,286 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 832 transitions. [2018-02-04 04:05:54,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-02-04 04:05:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 832 transitions. [2018-02-04 04:05:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-02-04 04:05:54,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:05:54,287 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 04:05:54,287 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:05:54,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1303457597, now seen corresponding path program 42 times [2018-02-04 04:05:54,288 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:05:54,288 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:05:54,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:54,288 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:05:54,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:05:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:05:54,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:05:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:54,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:05:54,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:05:54,827 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:05:54,929 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 04:05:54,929 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:05:54,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:05:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:05:55,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:05:55,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44] total 88 [2018-02-04 04:05:55,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-02-04 04:05:55,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-02-04 04:05:55,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=5852, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 04:05:55,688 INFO L87 Difference]: Start difference. First operand 620 states and 832 transitions. Second operand 89 states. [2018-02-04 04:06:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:03,982 INFO L93 Difference]: Finished difference Result 681 states and 900 transitions. [2018-02-04 04:06:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 04:06:03,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 218 [2018-02-04 04:06:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:03,984 INFO L225 Difference]: With dead ends: 681 [2018-02-04 04:06:03,984 INFO L226 Difference]: Without dead ends: 681 [2018-02-04 04:06:03,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3567 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1980, Invalid=5852, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 04:06:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-02-04 04:06:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 634. [2018-02-04 04:06:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-02-04 04:06:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 851 transitions. [2018-02-04 04:06:03,988 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 851 transitions. Word has length 218 [2018-02-04 04:06:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:03,989 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 851 transitions. [2018-02-04 04:06:03,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-02-04 04:06:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 851 transitions. [2018-02-04 04:06:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-04 04:06:03,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:03,990 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:03,990 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash 942120847, now seen corresponding path program 43 times [2018-02-04 04:06:03,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:03,990 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:03,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:03,990 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:03,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:04,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:04,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:04,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:04,534 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:06:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:04,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:04,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:04,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-02-04 04:06:04,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 04:06:04,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 04:06:04,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:06:04,579 INFO L87 Difference]: Start difference. First operand 634 states and 851 transitions. Second operand 47 states. [2018-02-04 04:06:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:06,193 INFO L93 Difference]: Finished difference Result 696 states and 920 transitions. [2018-02-04 04:06:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 04:06:06,194 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 223 [2018-02-04 04:06:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:06,195 INFO L225 Difference]: With dead ends: 696 [2018-02-04 04:06:06,195 INFO L226 Difference]: Without dead ends: 696 [2018-02-04 04:06:06,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 04:06:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-02-04 04:06:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 648. [2018-02-04 04:06:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-02-04 04:06:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 870 transitions. [2018-02-04 04:06:06,200 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 870 transitions. Word has length 223 [2018-02-04 04:06:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:06,201 INFO L432 AbstractCegarLoop]: Abstraction has 648 states and 870 transitions. [2018-02-04 04:06:06,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 04:06:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 870 transitions. [2018-02-04 04:06:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-02-04 04:06:06,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:06,202 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:06,202 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash 304386685, now seen corresponding path program 44 times [2018-02-04 04:06:06,202 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:06,202 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:06,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:06,203 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:06:06,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:06,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:06,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:06,778 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:06,779 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:06:06,793 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:06:06,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:06,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:07,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:07,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-02-04 04:06:07,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 04:06:07,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 04:06:07,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 04:06:07,005 INFO L87 Difference]: Start difference. First operand 648 states and 870 transitions. Second operand 55 states. [2018-02-04 04:06:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:09,190 INFO L93 Difference]: Finished difference Result 711 states and 940 transitions. [2018-02-04 04:06:09,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 04:06:09,190 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 228 [2018-02-04 04:06:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:09,191 INFO L225 Difference]: With dead ends: 711 [2018-02-04 04:06:09,191 INFO L226 Difference]: Without dead ends: 711 [2018-02-04 04:06:09,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3077, Invalid=6625, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 04:06:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-02-04 04:06:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 662. [2018-02-04 04:06:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-02-04 04:06:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 889 transitions. [2018-02-04 04:06:09,196 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 889 transitions. Word has length 228 [2018-02-04 04:06:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:09,197 INFO L432 AbstractCegarLoop]: Abstraction has 662 states and 889 transitions. [2018-02-04 04:06:09,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 04:06:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 889 transitions. [2018-02-04 04:06:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 04:06:09,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:09,198 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:09,198 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1601158065, now seen corresponding path program 45 times [2018-02-04 04:06:09,198 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:09,199 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:09,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:09,199 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:09,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:09,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:06:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:09,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:09,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:09,883 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:06:09,944 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 04:06:09,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:09,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:10,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:10,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 94 [2018-02-04 04:06:10,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-02-04 04:06:10,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-02-04 04:06:10,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 04:06:10,559 INFO L87 Difference]: Start difference. First operand 662 states and 889 transitions. Second operand 95 states. [2018-02-04 04:06:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:19,403 INFO L93 Difference]: Finished difference Result 726 states and 960 transitions. [2018-02-04 04:06:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 04:06:19,404 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 233 [2018-02-04 04:06:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:19,405 INFO L225 Difference]: With dead ends: 726 [2018-02-04 04:06:19,405 INFO L226 Difference]: Without dead ends: 726 [2018-02-04 04:06:19,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 04:06:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-02-04 04:06:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 676. [2018-02-04 04:06:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-02-04 04:06:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 908 transitions. [2018-02-04 04:06:19,410 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 908 transitions. Word has length 233 [2018-02-04 04:06:19,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:19,410 INFO L432 AbstractCegarLoop]: Abstraction has 676 states and 908 transitions. [2018-02-04 04:06:19,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-02-04 04:06:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 908 transitions. [2018-02-04 04:06:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-04 04:06:19,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:19,411 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:19,411 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -853219907, now seen corresponding path program 46 times [2018-02-04 04:06:19,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:19,412 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:19,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:19,412 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:19,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:19,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:19,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:19,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:19,995 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:06:20,043 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:06:20,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:20,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:20,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:20,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 52 [2018-02-04 04:06:20,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:06:20,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:06:20,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1146, Invalid=1610, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:06:20,173 INFO L87 Difference]: Start difference. First operand 676 states and 908 transitions. Second operand 53 states. [2018-02-04 04:06:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:22,067 INFO L93 Difference]: Finished difference Result 741 states and 980 transitions. [2018-02-04 04:06:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 04:06:22,067 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 238 [2018-02-04 04:06:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:22,069 INFO L225 Difference]: With dead ends: 741 [2018-02-04 04:06:22,069 INFO L226 Difference]: Without dead ends: 741 [2018-02-04 04:06:22,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3490, Invalid=6212, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 04:06:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-02-04 04:06:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 690. [2018-02-04 04:06:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-02-04 04:06:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 927 transitions. [2018-02-04 04:06:22,074 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 927 transitions. Word has length 238 [2018-02-04 04:06:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:22,074 INFO L432 AbstractCegarLoop]: Abstraction has 690 states and 927 transitions. [2018-02-04 04:06:22,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:06:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 927 transitions. [2018-02-04 04:06:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-02-04 04:06:22,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:22,075 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:22,075 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash -721290993, now seen corresponding path program 47 times [2018-02-04 04:06:22,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:22,076 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:22,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:22,076 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:22,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:22,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:22,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:22,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:22,735 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:06:22,794 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 04:06:22,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:22,797 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:23,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:23,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2018-02-04 04:06:23,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-02-04 04:06:23,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-02-04 04:06:23,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 04:06:23,573 INFO L87 Difference]: Start difference. First operand 690 states and 927 transitions. Second operand 99 states. [2018-02-04 04:06:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:36,194 INFO L93 Difference]: Finished difference Result 756 states and 1000 transitions. [2018-02-04 04:06:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 04:06:36,194 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 243 [2018-02-04 04:06:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:36,196 INFO L225 Difference]: With dead ends: 756 [2018-02-04 04:06:36,196 INFO L226 Difference]: Without dead ends: 756 [2018-02-04 04:06:36,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4511 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 04:06:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-04 04:06:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 704. [2018-02-04 04:06:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-02-04 04:06:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 946 transitions. [2018-02-04 04:06:36,201 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 946 transitions. Word has length 243 [2018-02-04 04:06:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:36,202 INFO L432 AbstractCegarLoop]: Abstraction has 704 states and 946 transitions. [2018-02-04 04:06:36,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-02-04 04:06:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 946 transitions. [2018-02-04 04:06:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-02-04 04:06:36,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:36,203 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:36,203 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash 658909437, now seen corresponding path program 48 times [2018-02-04 04:06:36,203 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:36,203 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:36,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:36,203 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:36,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:36,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:36,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:36,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:36,861 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:06:36,916 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 04:06:36,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:36,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:37,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:37,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50] total 100 [2018-02-04 04:06:37,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-02-04 04:06:37,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-02-04 04:06:37,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1850, Invalid=8250, Unknown=0, NotChecked=0, Total=10100 [2018-02-04 04:06:37,897 INFO L87 Difference]: Start difference. First operand 704 states and 946 transitions. Second operand 101 states. [2018-02-04 04:06:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:48,941 INFO L93 Difference]: Finished difference Result 771 states and 1020 transitions. [2018-02-04 04:06:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 04:06:48,941 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 248 [2018-02-04 04:06:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:48,943 INFO L225 Difference]: With dead ends: 771 [2018-02-04 04:06:48,943 INFO L226 Difference]: Without dead ends: 771 [2018-02-04 04:06:48,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3848 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1850, Invalid=8250, Unknown=0, NotChecked=0, Total=10100 [2018-02-04 04:06:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-02-04 04:06:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 718. [2018-02-04 04:06:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-02-04 04:06:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 965 transitions. [2018-02-04 04:06:48,949 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 965 transitions. Word has length 248 [2018-02-04 04:06:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:48,949 INFO L432 AbstractCegarLoop]: Abstraction has 718 states and 965 transitions. [2018-02-04 04:06:48,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-02-04 04:06:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 965 transitions. [2018-02-04 04:06:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-04 04:06:48,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:48,952 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:48,952 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:48,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1768472015, now seen corresponding path program 49 times [2018-02-04 04:06:48,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:48,952 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:48,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:48,953 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:48,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:48,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:49,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:49,708 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:49,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:06:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:49,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:49,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:49,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-02-04 04:06:49,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:06:49,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:06:49,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:06:49,758 INFO L87 Difference]: Start difference. First operand 718 states and 965 transitions. Second operand 53 states. [2018-02-04 04:06:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:51,740 INFO L93 Difference]: Finished difference Result 786 states and 1040 transitions. [2018-02-04 04:06:51,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 04:06:51,741 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 253 [2018-02-04 04:06:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:51,742 INFO L225 Difference]: With dead ends: 786 [2018-02-04 04:06:51,742 INFO L226 Difference]: Without dead ends: 786 [2018-02-04 04:06:51,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 253 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:06:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2018-02-04 04:06:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 732. [2018-02-04 04:06:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-02-04 04:06:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 984 transitions. [2018-02-04 04:06:51,748 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 984 transitions. Word has length 253 [2018-02-04 04:06:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:51,748 INFO L432 AbstractCegarLoop]: Abstraction has 732 states and 984 transitions. [2018-02-04 04:06:51,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:06:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 984 transitions. [2018-02-04 04:06:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-02-04 04:06:51,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:51,750 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:51,750 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash 538729533, now seen corresponding path program 50 times [2018-02-04 04:06:51,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:51,750 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:51,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:51,751 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:06:51,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:51,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:52,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:52,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:52,494 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:06:52,505 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:06:52,505 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:52,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:52,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:52,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-02-04 04:06:52,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 04:06:52,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 04:06:52,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 04:06:52,631 INFO L87 Difference]: Start difference. First operand 732 states and 984 transitions. Second operand 58 states. [2018-02-04 04:06:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:06:54,983 INFO L93 Difference]: Finished difference Result 801 states and 1060 transitions. [2018-02-04 04:06:54,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 04:06:54,983 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 258 [2018-02-04 04:06:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:06:54,985 INFO L225 Difference]: With dead ends: 801 [2018-02-04 04:06:54,985 INFO L226 Difference]: Without dead ends: 801 [2018-02-04 04:06:54,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 254 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:06:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-02-04 04:06:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 746. [2018-02-04 04:06:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-02-04 04:06:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1003 transitions. [2018-02-04 04:06:54,991 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1003 transitions. Word has length 258 [2018-02-04 04:06:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:06:54,992 INFO L432 AbstractCegarLoop]: Abstraction has 746 states and 1003 transitions. [2018-02-04 04:06:54,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 04:06:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1003 transitions. [2018-02-04 04:06:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-02-04 04:06:54,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:06:54,994 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 04:06:54,994 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:06:54,994 INFO L82 PathProgramCache]: Analyzing trace with hash -89091441, now seen corresponding path program 51 times [2018-02-04 04:06:54,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:06:54,994 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:06:54,994 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:54,994 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:06:54,994 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:06:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:06:55,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:06:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:55,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:06:55,776 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:06:55,776 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:06:55,843 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 04:06:55,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:06:55,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:06:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:06:56,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:06:56,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 106 [2018-02-04 04:06:56,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-02-04 04:06:56,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-02-04 04:06:56,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 04:06:56,552 INFO L87 Difference]: Start difference. First operand 746 states and 1003 transitions. Second operand 107 states. Received shutdown request... [2018-02-04 04:07:01,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:07:01,821 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:07:01,824 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:07:01,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:07:01 BoogieIcfgContainer [2018-02-04 04:07:01,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:07:01,825 INFO L168 Benchmark]: Toolchain (without parser) took 167418.45 ms. Allocated memory was 400.0 MB in the beginning and 1.2 GB in the end (delta: 770.2 MB). Free memory was 358.0 MB in the beginning and 658.2 MB in the end (delta: -300.2 MB). Peak memory consumption was 469.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:01,826 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:07:01,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.49 ms. Allocated memory is still 400.0 MB. Free memory was 358.0 MB in the beginning and 350.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:01,826 INFO L168 Benchmark]: Boogie Preprocessor took 22.17 ms. Allocated memory is still 400.0 MB. Free memory was 350.0 MB in the beginning and 348.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:01,826 INFO L168 Benchmark]: RCFGBuilder took 195.76 ms. Allocated memory is still 400.0 MB. Free memory was 348.5 MB in the beginning and 332.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:01,827 INFO L168 Benchmark]: TraceAbstraction took 167074.44 ms. Allocated memory was 400.0 MB in the beginning and 1.2 GB in the end (delta: 770.2 MB). Free memory was 332.7 MB in the beginning and 658.2 MB in the end (delta: -325.6 MB). Peak memory consumption was 444.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:01,828 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.14 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 123.49 ms. Allocated memory is still 400.0 MB. Free memory was 358.0 MB in the beginning and 350.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.17 ms. Allocated memory is still 400.0 MB. Free memory was 350.0 MB in the beginning and 348.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 195.76 ms. Allocated memory is still 400.0 MB. Free memory was 348.5 MB in the beginning and 332.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 167074.44 ms. Allocated memory was 400.0 MB in the beginning and 1.2 GB in the end (delta: 770.2 MB). Free memory was 332.7 MB in the beginning and 658.2 MB in the end (delta: -325.6 MB). Peak memory consumption was 444.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and interpolant automaton (currently 38 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and interpolant automaton (currently 38 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and interpolant automaton (currently 38 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 19). Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and interpolant automaton (currently 38 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 4 error locations. TIMEOUT Result, 167.0s OverallTime, 52 OverallIterations, 52 TraceHistogramMax, 136.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7989 SDtfs, 52929 SDslu, 160859 SDs, 0 SdLazy, 517562 SolverSat, 18137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9035 GetRequests, 6243 SyntacticMatches, 4 SemanticMatches, 2788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61312 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=746occurred in iteration=51, 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.2s AutomataMinimizationTime, 51 MinimizatonAttempts, 1530 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 27.6s InterpolantComputationTime, 14084 NumberOfCodeBlocks, 14084 NumberOfCodeBlocksAsserted, 787 NumberOfCheckSat, 13981 ConstructedInterpolants, 0 QuantifiedInterpolants, 8717797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10251 ConjunctsInSsa, 2247 ConjunctsInUnsatCore, 103 InterpolantComputations, 1 PerfectInterpolantSequences, 0/228956 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/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-07-01-834.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sanfoundry_24_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-07-01-834.csv Completed graceful shutdown