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-c17473d-m [2018-02-04 17:39:49,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:39:49,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:39:49,203 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:39:49,203 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:39:49,204 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:39:49,205 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:39:49,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:39:49,208 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:39:49,209 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:39:49,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:39:49,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:39:49,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:39:49,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:39:49,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:39:49,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:39:49,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:39:49,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:39:49,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:39:49,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:39:49,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:39:49,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:39:49,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:39:49,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:39:49,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:39:49,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:39:49,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:39:49,226 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:39:49,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:39:49,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:39:49,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:39:49,226 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:39:49,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:39:49,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:39:49,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:39:49,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:39:49,236 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:39:49,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:39:49,236 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:39:49,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:39:49,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:39:49,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:39:49,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:39:49,237 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:39:49,237 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:39:49,237 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:39:49,237 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:39:49,237 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:39:49,238 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:39:49,238 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:39:49,238 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:39:49,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:39:49,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:39:49,238 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:39:49,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:39:49,238 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:39:49,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:39:49,276 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:39:49,279 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:39:49,280 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:39:49,280 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:39:49,281 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 17:39:49,390 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:39:49,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:39:49,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:39:49,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:39:49,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:39:49,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:39:49" (1/1) ... [2018-02-04 17:39:49,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2d29dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49, skipping insertion in model container [2018-02-04 17:39:49,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:39:49" (1/1) ... [2018-02-04 17:39:49,416 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:39:49,429 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:39:49,532 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:39:49,541 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:39:49,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49 WrapperNode [2018-02-04 17:39:49,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:39:49,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:39:49,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:39:49,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:39:49,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49" (1/1) ... [2018-02-04 17:39:49,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49" (1/1) ... [2018-02-04 17:39:49,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49" (1/1) ... [2018-02-04 17:39:49,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49" (1/1) ... [2018-02-04 17:39:49,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49" (1/1) ... [2018-02-04 17:39:49,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49" (1/1) ... [2018-02-04 17:39:49,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49" (1/1) ... [2018-02-04 17:39:49,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:39:49,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:39:49,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:39:49,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:39:49,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:39:49,609 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:39:49,609 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:39:49,610 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 17:39:49,610 INFO L136 BoogieDeclarations]: Found implementation of procedure printEven [2018-02-04 17:39:49,610 INFO L136 BoogieDeclarations]: Found implementation of procedure printOdd [2018-02-04 17:39:49,610 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:39:49,610 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 17:39:49,610 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 17:39:49,610 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:39:49,610 INFO L128 BoogieDeclarations]: Found specification of procedure printEven [2018-02-04 17:39:49,610 INFO L128 BoogieDeclarations]: Found specification of procedure printOdd [2018-02-04 17:39:49,610 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:39:49,610 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:39:49,610 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:39:49,714 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:39:49,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:39:49 BoogieIcfgContainer [2018-02-04 17:39:49,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:39:49,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:39:49,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:39:49,716 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:39:49,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:39:49" (1/3) ... [2018-02-04 17:39:49,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5549308e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:39:49, skipping insertion in model container [2018-02-04 17:39:49,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:49" (2/3) ... [2018-02-04 17:39:49,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5549308e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:39:49, skipping insertion in model container [2018-02-04 17:39:49,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:39:49" (3/3) ... [2018-02-04 17:39:49,718 INFO L107 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i [2018-02-04 17:39:49,723 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:39:49,728 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-02-04 17:39:49,760 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:39:49,760 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:39:49,760 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:39:49,761 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:39:49,761 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:39:49,761 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:39:49,761 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:39:49,761 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:39:49,762 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:39:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-02-04 17:39:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 17:39:49,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:49,806 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:49,807 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:49,810 INFO L82 PathProgramCache]: Analyzing trace with hash 529177341, now seen corresponding path program 1 times [2018-02-04 17:39:49,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:49,812 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:49,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:49,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:49,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:49,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:49,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:39:49,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:39:49,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:39:49,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:39:49,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:39:49,962 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-02-04 17:39:50,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:50,024 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-02-04 17:39:50,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:39:50,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-04 17:39:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:50,031 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:39:50,031 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 17:39:50,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:39:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 17:39:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-04 17:39:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:39:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-02-04 17:39:50,105 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2018-02-04 17:39:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:50,106 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-02-04 17:39:50,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:39:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-02-04 17:39:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:39:50,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:50,107 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:50,107 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:50,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2078569521, now seen corresponding path program 1 times [2018-02-04 17:39:50,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:50,107 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:50,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:50,108 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:50,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:50,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:50,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:50,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:50,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:50,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:50,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:50,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-04 17:39:50,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:39:50,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:39:50,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:39:50,191 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-02-04 17:39:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:50,259 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-02-04 17:39:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:39:50,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 17:39:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:50,260 INFO L225 Difference]: With dead ends: 66 [2018-02-04 17:39:50,260 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 17:39:50,260 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 17:39:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 17:39:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-02-04 17:39:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:39:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-02-04 17:39:50,265 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 13 [2018-02-04 17:39:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:50,265 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-02-04 17:39:50,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:39:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-02-04 17:39:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:39:50,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:50,266 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:50,266 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1794788925, now seen corresponding path program 2 times [2018-02-04 17:39:50,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:50,266 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:50,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:50,267 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:50,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:50,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:50,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:50,336 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:50,337 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:39:50,350 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:39:50,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:50,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:50,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:50,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-04 17:39:50,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:39:50,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:39:50,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:39:50,358 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 5 states. [2018-02-04 17:39:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:50,481 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-02-04 17:39:50,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:39:50,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 17:39:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:50,483 INFO L225 Difference]: With dead ends: 81 [2018-02-04 17:39:50,483 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 17:39:50,483 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 17:39:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 17:39:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-02-04 17:39:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 17:39:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 17:39:50,492 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 18 [2018-02-04 17:39:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:50,492 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 17:39:50,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:39:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 17:39:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:39:50,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:50,494 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:50,494 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:50,494 INFO L82 PathProgramCache]: Analyzing trace with hash -424025969, now seen corresponding path program 3 times [2018-02-04 17:39:50,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:50,494 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:50,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:50,495 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:50,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:50,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:50,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:50,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:50,554 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:39:50,572 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:39:50,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:50,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:50,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:50,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-02-04 17:39:50,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:39:50,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:39:50,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:39:50,596 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 11 states. [2018-02-04 17:39:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:50,748 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-02-04 17:39:50,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:39:50,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 17:39:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:50,749 INFO L225 Difference]: With dead ends: 96 [2018-02-04 17:39:50,749 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 17:39:50,749 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 17:39:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 17:39:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2018-02-04 17:39:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 17:39:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2018-02-04 17:39:50,754 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 23 [2018-02-04 17:39:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:50,754 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2018-02-04 17:39:50,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:39:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2018-02-04 17:39:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:39:50,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:50,755 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:50,755 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1714228867, now seen corresponding path program 4 times [2018-02-04 17:39:50,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:50,755 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:50,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:50,756 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:50,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:50,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:50,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:50,862 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:50,863 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:39:50,878 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:39:50,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:50,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:50,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:50,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-02-04 17:39:50,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:39:50,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:39:50,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:39:50,942 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand 13 states. [2018-02-04 17:39:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:51,215 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2018-02-04 17:39:51,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:39:51,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-04 17:39:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:51,216 INFO L225 Difference]: With dead ends: 111 [2018-02-04 17:39:51,216 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 17:39:51,216 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 17:39:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 17:39:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2018-02-04 17:39:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 17:39:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2018-02-04 17:39:51,220 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 28 [2018-02-04 17:39:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:51,221 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2018-02-04 17:39:51,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:39:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2018-02-04 17:39:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:39:51,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:51,222 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:51,222 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash -771406513, now seen corresponding path program 5 times [2018-02-04 17:39:51,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:51,222 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:51,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:51,223 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:51,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:51,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:51,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:51,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:51,298 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:39:51,317 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 17:39:51,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:51,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:51,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:51,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-02-04 17:39:51,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:39:51,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:39:51,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:39:51,380 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand 15 states. [2018-02-04 17:39:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:51,708 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2018-02-04 17:39:51,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:39:51,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-02-04 17:39:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:51,710 INFO L225 Difference]: With dead ends: 126 [2018-02-04 17:39:51,710 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 17:39:51,710 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 17:39:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 17:39:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-02-04 17:39:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 17:39:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2018-02-04 17:39:51,717 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 33 [2018-02-04 17:39:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:51,717 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2018-02-04 17:39:51,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:39:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2018-02-04 17:39:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:39:51,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:51,719 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:51,719 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:51,719 INFO L82 PathProgramCache]: Analyzing trace with hash -240614211, now seen corresponding path program 6 times [2018-02-04 17:39:51,719 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:51,719 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:51,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:51,720 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:51,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:51,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:51,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:51,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:51,796 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:39:51,806 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 17:39:51,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:51,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:51,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:51,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-02-04 17:39:51,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:39:51,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:39:51,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:39:51,835 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 13 states. [2018-02-04 17:39:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:52,034 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-02-04 17:39:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:39:52,035 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-04 17:39:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:52,036 INFO L225 Difference]: With dead ends: 141 [2018-02-04 17:39:52,036 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 17:39:52,036 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 17:39:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 17:39:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-02-04 17:39:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 17:39:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2018-02-04 17:39:52,043 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 38 [2018-02-04 17:39:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:52,043 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2018-02-04 17:39:52,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:39:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2018-02-04 17:39:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 17:39:52,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:52,045 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:52,047 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:52,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1558821391, now seen corresponding path program 7 times [2018-02-04 17:39:52,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:52,047 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:52,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:52,048 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:52,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:52,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:52,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:52,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:52,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:52,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:52,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:52,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 17:39:52,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:39:52,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:39:52,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:39:52,156 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand 11 states. [2018-02-04 17:39:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:52,412 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2018-02-04 17:39:52,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:39:52,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-02-04 17:39:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:52,413 INFO L225 Difference]: With dead ends: 156 [2018-02-04 17:39:52,413 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 17:39:52,413 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 17:39:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 17:39:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2018-02-04 17:39:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 17:39:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2018-02-04 17:39:52,421 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 43 [2018-02-04 17:39:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:52,422 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2018-02-04 17:39:52,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:39:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2018-02-04 17:39:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:39:52,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:52,423 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:52,423 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:52,424 INFO L82 PathProgramCache]: Analyzing trace with hash -821098499, now seen corresponding path program 8 times [2018-02-04 17:39:52,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:52,424 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:52,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:52,425 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:52,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:52,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:52,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:52,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:52,541 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:39:52,550 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:39:52,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:52,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:52,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:52,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 17:39:52,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:39:52,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:39:52,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:39:52,567 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand 11 states. [2018-02-04 17:39:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:53,166 INFO L93 Difference]: Finished difference Result 171 states and 220 transitions. [2018-02-04 17:39:53,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:39:53,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 17:39:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:53,167 INFO L225 Difference]: With dead ends: 171 [2018-02-04 17:39:53,167 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 17:39:53,167 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 17:39:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 17:39:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-02-04 17:39:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 17:39:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2018-02-04 17:39:53,176 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 48 [2018-02-04 17:39:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:53,176 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2018-02-04 17:39:53,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:39:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2018-02-04 17:39:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 17:39:53,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:53,177 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:53,177 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:53,177 INFO L82 PathProgramCache]: Analyzing trace with hash -413974833, now seen corresponding path program 9 times [2018-02-04 17:39:53,177 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:53,177 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:53,178 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:53,178 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:53,178 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:53,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:53,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:53,342 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:53,342 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:39:53,363 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 17:39:53,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:53,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:53,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:53,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-02-04 17:39:53,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:39:53,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:39:53,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:39:53,379 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand 13 states. [2018-02-04 17:39:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:53,644 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2018-02-04 17:39:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:39:53,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-04 17:39:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:53,645 INFO L225 Difference]: With dead ends: 186 [2018-02-04 17:39:53,645 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 17:39:53,645 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 17:39:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 17:39:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-02-04 17:39:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 17:39:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2018-02-04 17:39:53,651 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 53 [2018-02-04 17:39:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:53,651 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2018-02-04 17:39:53,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:39:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2018-02-04 17:39:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 17:39:53,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:53,653 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:53,653 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:53,653 INFO L82 PathProgramCache]: Analyzing trace with hash -442860739, now seen corresponding path program 10 times [2018-02-04 17:39:53,653 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:53,653 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:53,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:53,654 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:53,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:53,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:53,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:53,857 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:53,857 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:39:53,892 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:39:53,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:53,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:54,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:54,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-02-04 17:39:54,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:39:54,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:39:54,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:39:54,063 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand 17 states. [2018-02-04 17:39:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:54,524 INFO L93 Difference]: Finished difference Result 201 states and 260 transitions. [2018-02-04 17:39:54,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:39:54,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-04 17:39:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:54,525 INFO L225 Difference]: With dead ends: 201 [2018-02-04 17:39:54,525 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 17:39:54,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:39:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 17:39:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2018-02-04 17:39:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 17:39:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-02-04 17:39:54,531 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 58 [2018-02-04 17:39:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:54,531 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-02-04 17:39:54,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:39:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-02-04 17:39:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 17:39:54,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:54,532 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:54,532 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash -634530929, now seen corresponding path program 11 times [2018-02-04 17:39:54,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:54,533 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:54,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,534 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:54,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:54,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:54,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:54,654 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:39:54,674 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:39:54,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:54,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:54,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:54,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-02-04 17:39:54,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:39:54,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:39:54,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:39:54,777 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 27 states. [2018-02-04 17:39:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:55,900 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2018-02-04 17:39:55,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:39:55,901 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-02-04 17:39:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:55,901 INFO L225 Difference]: With dead ends: 216 [2018-02-04 17:39:55,902 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 17:39:55,902 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 17:39:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 17:39:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2018-02-04 17:39:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 17:39:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2018-02-04 17:39:55,908 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 63 [2018-02-04 17:39:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:55,908 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2018-02-04 17:39:55,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:39:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-02-04 17:39:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 17:39:55,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:55,910 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:55,910 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2145312381, now seen corresponding path program 12 times [2018-02-04 17:39:55,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:55,910 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:55,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,911 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:55,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:55,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:56,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:56,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:56,041 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:39:56,069 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 17:39:56,070 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:56,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:56,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:56,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-02-04 17:39:56,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:39:56,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:39:56,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:39:56,186 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand 29 states. [2018-02-04 17:39:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:57,118 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2018-02-04 17:39:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:39:57,118 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 68 [2018-02-04 17:39:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:57,119 INFO L225 Difference]: With dead ends: 231 [2018-02-04 17:39:57,120 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 17:39:57,120 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 17:39:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 17:39:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2018-02-04 17:39:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 17:39:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 281 transitions. [2018-02-04 17:39:57,125 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 281 transitions. Word has length 68 [2018-02-04 17:39:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:57,126 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 281 transitions. [2018-02-04 17:39:57,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:39:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 281 transitions. [2018-02-04 17:39:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 17:39:57,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:57,127 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:57,127 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:57,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1734703183, now seen corresponding path program 13 times [2018-02-04 17:39:57,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:57,127 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:57,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:57,128 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:57,128 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:57,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:57,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:57,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:57,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:57,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:57,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:57,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-02-04 17:39:57,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:39:57,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:39:57,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:39:57,442 INFO L87 Difference]: Start difference. First operand 214 states and 281 transitions. Second operand 17 states. [2018-02-04 17:39:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:57,836 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2018-02-04 17:39:57,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:39:57,836 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-02-04 17:39:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:57,837 INFO L225 Difference]: With dead ends: 246 [2018-02-04 17:39:57,837 INFO L226 Difference]: Without dead ends: 246 [2018-02-04 17:39:57,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:39:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-04 17:39:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2018-02-04 17:39:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 17:39:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 300 transitions. [2018-02-04 17:39:57,841 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 300 transitions. Word has length 73 [2018-02-04 17:39:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:57,842 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 300 transitions. [2018-02-04 17:39:57,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:39:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2018-02-04 17:39:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 17:39:57,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:57,842 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:57,843 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1083166275, now seen corresponding path program 14 times [2018-02-04 17:39:57,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:57,843 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:57,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:57,843 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:57,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:57,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:57,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:57,997 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:57,999 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:39:58,012 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:39:58,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:58,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:58,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:58,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-02-04 17:39:58,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:39:58,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:39:58,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:39:58,081 INFO L87 Difference]: Start difference. First operand 228 states and 300 transitions. Second operand 22 states. [2018-02-04 17:39:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:58,657 INFO L93 Difference]: Finished difference Result 261 states and 340 transitions. [2018-02-04 17:39:58,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:39:58,657 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2018-02-04 17:39:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:58,659 INFO L225 Difference]: With dead ends: 261 [2018-02-04 17:39:58,659 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 17:39:58,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=872, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 17:39:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 17:39:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 242. [2018-02-04 17:39:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 17:39:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-02-04 17:39:58,665 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 78 [2018-02-04 17:39:58,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:58,665 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-02-04 17:39:58,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:39:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-02-04 17:39:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 17:39:58,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:58,667 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:58,667 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1239821583, now seen corresponding path program 15 times [2018-02-04 17:39:58,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:58,668 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:58,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:58,668 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:58,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:58,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:58,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:58,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:58,808 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:39:58,836 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 17:39:58,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:58,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:39:59,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:59,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-04 17:39:59,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:39:59,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:39:59,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:39:59,083 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 35 states. [2018-02-04 17:40:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:00,480 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2018-02-04 17:40:00,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:40:00,480 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 83 [2018-02-04 17:40:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:00,481 INFO L225 Difference]: With dead ends: 276 [2018-02-04 17:40:00,481 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 17:40:00,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:40:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 17:40:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2018-02-04 17:40:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 17:40:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 338 transitions. [2018-02-04 17:40:00,486 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 338 transitions. Word has length 83 [2018-02-04 17:40:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:00,487 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 338 transitions. [2018-02-04 17:40:00,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:40:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 338 transitions. [2018-02-04 17:40:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 17:40:00,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:00,488 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:00,488 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:00,488 INFO L82 PathProgramCache]: Analyzing trace with hash -589138691, now seen corresponding path program 16 times [2018-02-04 17:40:00,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:00,489 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:00,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:00,489 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:00,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:00,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:00,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:00,778 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:00,779 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:00,802 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:00,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:00,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:01,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:01,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2018-02-04 17:40:01,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:40:01,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:40:01,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:40:01,306 INFO L87 Difference]: Start difference. First operand 256 states and 338 transitions. Second operand 37 states. [2018-02-04 17:40:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:03,162 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2018-02-04 17:40:03,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:40:03,162 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 88 [2018-02-04 17:40:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:03,163 INFO L225 Difference]: With dead ends: 291 [2018-02-04 17:40:03,163 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 17:40:03,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:40:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 17:40:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2018-02-04 17:40:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 17:40:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2018-02-04 17:40:03,170 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 88 [2018-02-04 17:40:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:03,170 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2018-02-04 17:40:03,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:40:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2018-02-04 17:40:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 17:40:03,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:03,171 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:03,172 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:03,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2053377585, now seen corresponding path program 17 times [2018-02-04 17:40:03,172 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:03,172 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:03,173 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:03,173 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:03,173 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:03,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:03,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:03,356 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:03,357 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:03,388 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 17:40:03,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:03,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:03,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:03,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-02-04 17:40:03,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:40:03,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:40:03,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:40:03,639 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand 39 states. [2018-02-04 17:40:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:05,634 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2018-02-04 17:40:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:40:05,634 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 93 [2018-02-04 17:40:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:05,635 INFO L225 Difference]: With dead ends: 306 [2018-02-04 17:40:05,635 INFO L226 Difference]: Without dead ends: 306 [2018-02-04 17:40:05,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:40:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-04 17:40:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 284. [2018-02-04 17:40:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 17:40:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 376 transitions. [2018-02-04 17:40:05,640 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 376 transitions. Word has length 93 [2018-02-04 17:40:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:05,640 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 376 transitions. [2018-02-04 17:40:05,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:40:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 376 transitions. [2018-02-04 17:40:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 17:40:05,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:05,642 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:05,642 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1741269053, now seen corresponding path program 18 times [2018-02-04 17:40:05,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:05,642 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:05,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:05,643 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:05,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:05,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:05,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:05,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:05,825 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:40:05,853 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 17:40:05,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:05,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:06,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:06,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-04 17:40:06,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:40:06,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:40:06,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:40:06,250 INFO L87 Difference]: Start difference. First operand 284 states and 376 transitions. Second operand 41 states. [2018-02-04 17:40:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:07,961 INFO L93 Difference]: Finished difference Result 321 states and 420 transitions. [2018-02-04 17:40:07,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:40:07,961 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 98 [2018-02-04 17:40:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:07,963 INFO L225 Difference]: With dead ends: 321 [2018-02-04 17:40:07,963 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 17:40:07,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:40:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 17:40:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-02-04 17:40:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-04 17:40:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2018-02-04 17:40:07,970 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 98 [2018-02-04 17:40:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:07,970 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2018-02-04 17:40:07,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:40:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2018-02-04 17:40:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 17:40:07,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:07,972 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:07,972 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:07,972 INFO L82 PathProgramCache]: Analyzing trace with hash 661833359, now seen corresponding path program 19 times [2018-02-04 17:40:07,972 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:07,972 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:07,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:07,973 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:07,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:07,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:08,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:08,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:08,205 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:08,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:08,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:08,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-02-04 17:40:08,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:40:08,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:40:08,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:40:08,238 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand 23 states. [2018-02-04 17:40:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:08,723 INFO L93 Difference]: Finished difference Result 336 states and 440 transitions. [2018-02-04 17:40:08,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:40:08,723 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 103 [2018-02-04 17:40:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:08,724 INFO L225 Difference]: With dead ends: 336 [2018-02-04 17:40:08,724 INFO L226 Difference]: Without dead ends: 336 [2018-02-04 17:40:08,724 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 17:40:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-04 17:40:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 312. [2018-02-04 17:40:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-04 17:40:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 414 transitions. [2018-02-04 17:40:08,727 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 414 transitions. Word has length 103 [2018-02-04 17:40:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:08,728 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 414 transitions. [2018-02-04 17:40:08,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:40:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 414 transitions. [2018-02-04 17:40:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 17:40:08,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:08,729 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:08,729 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:08,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2034644099, now seen corresponding path program 20 times [2018-02-04 17:40:08,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:08,729 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:08,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:08,730 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:08,730 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:08,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:09,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:09,016 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:09,016 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:40:09,027 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:40:09,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:09,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:09,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:09,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 28 [2018-02-04 17:40:09,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:40:09,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:40:09,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:40:09,126 INFO L87 Difference]: Start difference. First operand 312 states and 414 transitions. Second operand 29 states. [2018-02-04 17:40:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:10,120 INFO L93 Difference]: Finished difference Result 351 states and 460 transitions. [2018-02-04 17:40:10,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:40:10,120 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2018-02-04 17:40:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:10,121 INFO L225 Difference]: With dead ends: 351 [2018-02-04 17:40:10,121 INFO L226 Difference]: Without dead ends: 351 [2018-02-04 17:40:10,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=757, Invalid=1595, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:40:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-04 17:40:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 326. [2018-02-04 17:40:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 17:40:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2018-02-04 17:40:10,127 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 108 [2018-02-04 17:40:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:10,127 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2018-02-04 17:40:10,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:40:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2018-02-04 17:40:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 17:40:10,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:10,129 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:10,129 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash 89566031, now seen corresponding path program 21 times [2018-02-04 17:40:10,129 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:10,129 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:10,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:10,130 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:10,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:10,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:10,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:10,384 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:10,385 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:40:10,417 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 17:40:10,417 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:10,420 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:10,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:10,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2018-02-04 17:40:10,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:40:10,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:40:10,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:40:10,749 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand 47 states. [2018-02-04 17:40:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:12,863 INFO L93 Difference]: Finished difference Result 366 states and 480 transitions. [2018-02-04 17:40:12,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:40:12,863 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 113 [2018-02-04 17:40:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:12,864 INFO L225 Difference]: With dead ends: 366 [2018-02-04 17:40:12,864 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 17:40:12,865 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 17:40:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 17:40:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2018-02-04 17:40:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-04 17:40:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 452 transitions. [2018-02-04 17:40:12,870 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 452 transitions. Word has length 113 [2018-02-04 17:40:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:12,870 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 452 transitions. [2018-02-04 17:40:12,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:40:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 452 transitions. [2018-02-04 17:40:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 17:40:12,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:12,872 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:12,872 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:12,873 INFO L82 PathProgramCache]: Analyzing trace with hash 927391421, now seen corresponding path program 22 times [2018-02-04 17:40:12,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:12,873 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:12,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:12,874 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:12,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:12,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:13,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:13,166 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:13,166 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:13,193 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:13,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:13,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:13,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:13,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 28 [2018-02-04 17:40:13,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:40:13,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:40:13,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=518, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:40:13,259 INFO L87 Difference]: Start difference. First operand 340 states and 452 transitions. Second operand 29 states. [2018-02-04 17:40:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:13,982 INFO L93 Difference]: Finished difference Result 381 states and 500 transitions. [2018-02-04 17:40:13,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:40:13,982 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-02-04 17:40:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:13,983 INFO L225 Difference]: With dead ends: 381 [2018-02-04 17:40:13,983 INFO L226 Difference]: Without dead ends: 381 [2018-02-04 17:40:13,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=886, Invalid=1664, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:40:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-04 17:40:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 354. [2018-02-04 17:40:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 17:40:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-02-04 17:40:13,987 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 118 [2018-02-04 17:40:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:13,988 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-02-04 17:40:13,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:40:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-02-04 17:40:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-04 17:40:13,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:13,989 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:13,989 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2117312527, now seen corresponding path program 23 times [2018-02-04 17:40:13,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:13,989 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:13,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:13,990 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:13,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:13,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:14,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:14,206 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:14,207 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:14,230 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 17:40:14,230 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:14,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:14,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:14,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-02-04 17:40:14,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 17:40:14,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 17:40:14,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:40:14,622 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 51 states. [2018-02-04 17:40:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:17,402 INFO L93 Difference]: Finished difference Result 396 states and 520 transitions. [2018-02-04 17:40:17,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:40:17,402 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 123 [2018-02-04 17:40:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:17,403 INFO L225 Difference]: With dead ends: 396 [2018-02-04 17:40:17,403 INFO L226 Difference]: Without dead ends: 396 [2018-02-04 17:40:17,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:40:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-04 17:40:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 368. [2018-02-04 17:40:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 17:40:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2018-02-04 17:40:17,406 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 123 [2018-02-04 17:40:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:17,407 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2018-02-04 17:40:17,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 17:40:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2018-02-04 17:40:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 17:40:17,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:17,407 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:17,407 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:17,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1912282627, now seen corresponding path program 24 times [2018-02-04 17:40:17,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:17,408 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:17,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:17,408 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:17,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:17,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:17,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:17,621 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:17,622 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:40:17,652 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 17:40:17,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:17,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:17,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:17,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2018-02-04 17:40:17,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:40:17,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:40:17,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:40:17,989 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand 53 states. [2018-02-04 17:40:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:20,871 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2018-02-04 17:40:20,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:40:20,872 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 128 [2018-02-04 17:40:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:20,872 INFO L225 Difference]: With dead ends: 411 [2018-02-04 17:40:20,873 INFO L226 Difference]: Without dead ends: 411 [2018-02-04 17:40:20,873 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 17:40:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-04 17:40:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 382. [2018-02-04 17:40:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 17:40:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 509 transitions. [2018-02-04 17:40:20,877 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 509 transitions. Word has length 128 [2018-02-04 17:40:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:20,877 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 509 transitions. [2018-02-04 17:40:20,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:40:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 509 transitions. [2018-02-04 17:40:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-04 17:40:20,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:20,878 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:20,878 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash 972399823, now seen corresponding path program 25 times [2018-02-04 17:40:20,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:20,878 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:20,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:20,878 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:20,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:20,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:21,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:21,367 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:21,367 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:21,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:21,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:21,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-02-04 17:40:21,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:40:21,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:40:21,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:40:21,406 INFO L87 Difference]: Start difference. First operand 382 states and 509 transitions. Second operand 29 states. [2018-02-04 17:40:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:22,160 INFO L93 Difference]: Finished difference Result 426 states and 560 transitions. [2018-02-04 17:40:22,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:40:22,160 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-02-04 17:40:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:22,161 INFO L225 Difference]: With dead ends: 426 [2018-02-04 17:40:22,161 INFO L226 Difference]: Without dead ends: 426 [2018-02-04 17:40:22,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 17:40:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-04 17:40:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2018-02-04 17:40:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 17:40:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 528 transitions. [2018-02-04 17:40:22,167 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 528 transitions. Word has length 133 [2018-02-04 17:40:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:22,167 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 528 transitions. [2018-02-04 17:40:22,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:40:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 528 transitions. [2018-02-04 17:40:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-02-04 17:40:22,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:22,169 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:22,169 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash -158870211, now seen corresponding path program 26 times [2018-02-04 17:40:22,169 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:22,169 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:22,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:22,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:22,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:22,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:22,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:22,404 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:22,404 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:40:22,413 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:40:22,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:22,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:22,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:22,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 34 [2018-02-04 17:40:22,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:40:22,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:40:22,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=807, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:40:22,492 INFO L87 Difference]: Start difference. First operand 396 states and 528 transitions. Second operand 35 states. [2018-02-04 17:40:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:23,627 INFO L93 Difference]: Finished difference Result 441 states and 580 transitions. [2018-02-04 17:40:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:40:23,627 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2018-02-04 17:40:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:23,628 INFO L225 Difference]: With dead ends: 441 [2018-02-04 17:40:23,628 INFO L226 Difference]: Without dead ends: 441 [2018-02-04 17:40:23,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1179, Invalid=2481, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:40:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-04 17:40:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2018-02-04 17:40:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 17:40:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 547 transitions. [2018-02-04 17:40:23,634 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 547 transitions. Word has length 138 [2018-02-04 17:40:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:23,634 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 547 transitions. [2018-02-04 17:40:23,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:40:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 547 transitions. [2018-02-04 17:40:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-04 17:40:23,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:23,636 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:23,636 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash -376915569, now seen corresponding path program 27 times [2018-02-04 17:40:23,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:23,636 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:23,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:23,637 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:23,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:23,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:23,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:23,967 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:23,968 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:40:24,001 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 17:40:24,001 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:24,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:24,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:24,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-02-04 17:40:24,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 17:40:24,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 17:40:24,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:40:24,292 INFO L87 Difference]: Start difference. First operand 410 states and 547 transitions. Second operand 59 states. [2018-02-04 17:40:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:28,070 INFO L93 Difference]: Finished difference Result 456 states and 600 transitions. [2018-02-04 17:40:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:40:28,070 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 143 [2018-02-04 17:40:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:28,071 INFO L225 Difference]: With dead ends: 456 [2018-02-04 17:40:28,071 INFO L226 Difference]: Without dead ends: 456 [2018-02-04 17:40:28,072 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 17:40:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-04 17:40:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 424. [2018-02-04 17:40:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-04 17:40:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 566 transitions. [2018-02-04 17:40:28,077 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 566 transitions. Word has length 143 [2018-02-04 17:40:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:28,077 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 566 transitions. [2018-02-04 17:40:28,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 17:40:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 566 transitions. [2018-02-04 17:40:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 17:40:28,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:28,079 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:28,079 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1935915133, now seen corresponding path program 28 times [2018-02-04 17:40:28,079 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:28,079 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:28,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:28,080 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:28,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:28,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:28,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:28,468 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:28,468 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:28,494 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:28,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:28,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:28,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:28,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 36 [2018-02-04 17:40:28,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:40:28,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:40:28,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=864, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:40:28,593 INFO L87 Difference]: Start difference. First operand 424 states and 566 transitions. Second operand 37 states. [2018-02-04 17:40:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:29,844 INFO L93 Difference]: Finished difference Result 471 states and 620 transitions. [2018-02-04 17:40:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 17:40:29,844 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 148 [2018-02-04 17:40:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:29,846 INFO L225 Difference]: With dead ends: 471 [2018-02-04 17:40:29,846 INFO L226 Difference]: Without dead ends: 471 [2018-02-04 17:40:29,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1385, Invalid=2775, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:40:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-02-04 17:40:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 438. [2018-02-04 17:40:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-04 17:40:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-02-04 17:40:29,852 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 148 [2018-02-04 17:40:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:29,853 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-02-04 17:40:29,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:40:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-02-04 17:40:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 17:40:29,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:29,854 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:29,854 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:29,854 INFO L82 PathProgramCache]: Analyzing trace with hash 114875983, now seen corresponding path program 29 times [2018-02-04 17:40:29,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:29,855 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:29,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:29,855 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:29,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:29,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:30,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:30,165 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:30,165 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:30,211 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 17:40:30,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:30,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:30,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:30,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2018-02-04 17:40:30,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 17:40:30,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 17:40:30,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:40:30,665 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 63 states. [2018-02-04 17:40:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:35,885 INFO L93 Difference]: Finished difference Result 486 states and 640 transitions. [2018-02-04 17:40:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:40:35,885 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 153 [2018-02-04 17:40:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:35,886 INFO L225 Difference]: With dead ends: 486 [2018-02-04 17:40:35,886 INFO L226 Difference]: Without dead ends: 486 [2018-02-04 17:40:35,887 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 17:40:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-02-04 17:40:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 452. [2018-02-04 17:40:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 17:40:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 604 transitions. [2018-02-04 17:40:35,890 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 604 transitions. Word has length 153 [2018-02-04 17:40:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:35,890 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 604 transitions. [2018-02-04 17:40:35,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 17:40:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 604 transitions. [2018-02-04 17:40:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-04 17:40:35,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:35,891 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:35,891 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash -567505987, now seen corresponding path program 30 times [2018-02-04 17:40:35,892 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:35,892 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:35,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:35,892 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:35,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:35,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:36,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:36,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:36,222 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:40:36,249 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 17:40:36,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:36,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:36,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:36,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 64 [2018-02-04 17:40:36,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 17:40:36,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 17:40:36,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=3104, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:40:36,712 INFO L87 Difference]: Start difference. First operand 452 states and 604 transitions. Second operand 65 states. [2018-02-04 17:40:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:39,950 INFO L93 Difference]: Finished difference Result 501 states and 660 transitions. [2018-02-04 17:40:39,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 17:40:39,950 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 158 [2018-02-04 17:40:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:39,951 INFO L225 Difference]: With dead ends: 501 [2018-02-04 17:40:39,951 INFO L226 Difference]: Without dead ends: 501 [2018-02-04 17:40:39,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1056, Invalid=3104, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:40:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-02-04 17:40:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 466. [2018-02-04 17:40:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-02-04 17:40:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2018-02-04 17:40:39,955 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 623 transitions. Word has length 158 [2018-02-04 17:40:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:39,955 INFO L432 AbstractCegarLoop]: Abstraction has 466 states and 623 transitions. [2018-02-04 17:40:39,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 17:40:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 623 transitions. [2018-02-04 17:40:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-04 17:40:39,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:39,956 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:39,956 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:39,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1798171889, now seen corresponding path program 31 times [2018-02-04 17:40:39,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:39,957 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:39,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:39,957 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:39,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:39,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:40,284 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:40,284 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:40,285 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:40,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:40,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:40,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 17:40:40,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:40:40,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:40:40,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:40:40,313 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand 35 states. [2018-02-04 17:40:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:41,260 INFO L93 Difference]: Finished difference Result 516 states and 680 transitions. [2018-02-04 17:40:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:40:41,260 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2018-02-04 17:40:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:41,261 INFO L225 Difference]: With dead ends: 516 [2018-02-04 17:40:41,261 INFO L226 Difference]: Without dead ends: 516 [2018-02-04 17:40:41,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:40:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-04 17:40:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 480. [2018-02-04 17:40:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-02-04 17:40:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 642 transitions. [2018-02-04 17:40:41,266 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 642 transitions. Word has length 163 [2018-02-04 17:40:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:41,267 INFO L432 AbstractCegarLoop]: Abstraction has 480 states and 642 transitions. [2018-02-04 17:40:41,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:40:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 642 transitions. [2018-02-04 17:40:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-04 17:40:41,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:41,268 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:41,268 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash 662064893, now seen corresponding path program 32 times [2018-02-04 17:40:41,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:41,269 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:41,269 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:41,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:41,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:41,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:41,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:41,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:41,944 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:40:41,955 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:40:41,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:41,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:41,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:41,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 17:40:41,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:40:41,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:40:41,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:40:41,996 INFO L87 Difference]: Start difference. First operand 480 states and 642 transitions. Second operand 35 states. [2018-02-04 17:40:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:46,494 INFO L93 Difference]: Finished difference Result 531 states and 700 transitions. [2018-02-04 17:40:46,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:40:46,494 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 168 [2018-02-04 17:40:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:46,496 INFO L225 Difference]: With dead ends: 531 [2018-02-04 17:40:46,496 INFO L226 Difference]: Without dead ends: 531 [2018-02-04 17:40:46,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:40:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-04 17:40:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 494. [2018-02-04 17:40:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-04 17:40:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 661 transitions. [2018-02-04 17:40:46,501 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 661 transitions. Word has length 168 [2018-02-04 17:40:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:46,501 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 661 transitions. [2018-02-04 17:40:46,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:40:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 661 transitions. [2018-02-04 17:40:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-04 17:40:46,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:46,503 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:46,503 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:46,503 INFO L82 PathProgramCache]: Analyzing trace with hash -547334193, now seen corresponding path program 33 times [2018-02-04 17:40:46,503 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:46,503 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:46,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:46,504 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:46,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:46,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:46,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:46,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:46,893 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:40:46,948 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 17:40:46,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:46,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:47,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:47,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 70 [2018-02-04 17:40:47,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 17:40:47,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 17:40:47,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 17:40:47,353 INFO L87 Difference]: Start difference. First operand 494 states and 661 transitions. Second operand 71 states. [2018-02-04 17:40:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:51,891 INFO L93 Difference]: Finished difference Result 546 states and 720 transitions. [2018-02-04 17:40:51,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 17:40:51,892 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 173 [2018-02-04 17:40:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:51,893 INFO L225 Difference]: With dead ends: 546 [2018-02-04 17:40:51,893 INFO L226 Difference]: Without dead ends: 546 [2018-02-04 17:40:51,894 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 17:40:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-04 17:40:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 508. [2018-02-04 17:40:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-04 17:40:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 680 transitions. [2018-02-04 17:40:51,900 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 680 transitions. Word has length 173 [2018-02-04 17:40:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:51,900 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 680 transitions. [2018-02-04 17:40:51,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 17:40:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 680 transitions. [2018-02-04 17:40:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-04 17:40:51,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:51,902 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:51,902 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:51,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1764425155, now seen corresponding path program 34 times [2018-02-04 17:40:51,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:51,902 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:51,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:51,903 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:51,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:51,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:52,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:52,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:52,317 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:52,343 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:52,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:52,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:52,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:52,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 40 [2018-02-04 17:40:52,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:40:52,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:40:52,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=992, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:40:52,414 INFO L87 Difference]: Start difference. First operand 508 states and 680 transitions. Second operand 41 states. [2018-02-04 17:40:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:53,592 INFO L93 Difference]: Finished difference Result 561 states and 740 transitions. [2018-02-04 17:40:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:40:53,593 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-02-04 17:40:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:53,594 INFO L225 Difference]: With dead ends: 561 [2018-02-04 17:40:53,594 INFO L226 Difference]: Without dead ends: 561 [2018-02-04 17:40:53,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1972, Invalid=3578, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:40:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-04 17:40:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 522. [2018-02-04 17:40:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-02-04 17:40:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 699 transitions. [2018-02-04 17:40:53,598 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 699 transitions. Word has length 178 [2018-02-04 17:40:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:53,599 INFO L432 AbstractCegarLoop]: Abstraction has 522 states and 699 transitions. [2018-02-04 17:40:53,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:40:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2018-02-04 17:40:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 17:40:53,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:53,600 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:53,600 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash 997174415, now seen corresponding path program 35 times [2018-02-04 17:40:53,600 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:53,600 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:53,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:53,600 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:53,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:53,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:54,016 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:54,016 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:54,017 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:54,073 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 17:40:54,073 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:54,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:40:54,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:54,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-02-04 17:40:54,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 17:40:54,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 17:40:54,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:40:54,735 INFO L87 Difference]: Start difference. First operand 522 states and 699 transitions. Second operand 75 states. [2018-02-04 17:41:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:01,544 INFO L93 Difference]: Finished difference Result 576 states and 760 transitions. [2018-02-04 17:41:01,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:41:01,544 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 183 [2018-02-04 17:41:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:01,546 INFO L225 Difference]: With dead ends: 576 [2018-02-04 17:41:01,546 INFO L226 Difference]: Without dead ends: 576 [2018-02-04 17:41:01,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:41:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-02-04 17:41:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 536. [2018-02-04 17:41:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-02-04 17:41:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 718 transitions. [2018-02-04 17:41:01,550 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 718 transitions. Word has length 183 [2018-02-04 17:41:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:01,550 INFO L432 AbstractCegarLoop]: Abstraction has 536 states and 718 transitions. [2018-02-04 17:41:01,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 17:41:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2018-02-04 17:41:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 17:41:01,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:01,551 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:01,551 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:01,551 INFO L82 PathProgramCache]: Analyzing trace with hash 182232445, now seen corresponding path program 36 times [2018-02-04 17:41:01,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:01,551 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:01,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:01,552 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:01,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:01,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:02,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:02,104 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:02,104 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:41:02,154 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 17:41:02,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:02,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:02,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:02,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38] total 76 [2018-02-04 17:41:02,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 17:41:02,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 17:41:02,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1406, Invalid=4446, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:41:02,888 INFO L87 Difference]: Start difference. First operand 536 states and 718 transitions. Second operand 77 states. [2018-02-04 17:41:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:07,407 INFO L93 Difference]: Finished difference Result 591 states and 780 transitions. [2018-02-04 17:41:07,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:41:07,408 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 188 [2018-02-04 17:41:07,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:07,409 INFO L225 Difference]: With dead ends: 591 [2018-02-04 17:41:07,409 INFO L226 Difference]: Without dead ends: 591 [2018-02-04 17:41:07,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1406, Invalid=4446, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:41:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-02-04 17:41:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 550. [2018-02-04 17:41:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-04 17:41:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 737 transitions. [2018-02-04 17:41:07,416 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 737 transitions. Word has length 188 [2018-02-04 17:41:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:07,416 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 737 transitions. [2018-02-04 17:41:07,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 17:41:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 737 transitions. [2018-02-04 17:41:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 17:41:07,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:07,417 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:07,417 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:07,418 INFO L82 PathProgramCache]: Analyzing trace with hash -957607601, now seen corresponding path program 37 times [2018-02-04 17:41:07,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:07,418 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:07,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:07,418 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:07,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:07,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:07,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:07,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:07,866 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:41:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:07,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:07,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:07,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-02-04 17:41:07,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:41:07,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:41:07,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:41:07,909 INFO L87 Difference]: Start difference. First operand 550 states and 737 transitions. Second operand 41 states. [2018-02-04 17:41:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:09,112 INFO L93 Difference]: Finished difference Result 606 states and 800 transitions. [2018-02-04 17:41:09,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:41:09,112 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 193 [2018-02-04 17:41:09,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:09,114 INFO L225 Difference]: With dead ends: 606 [2018-02-04 17:41:09,114 INFO L226 Difference]: Without dead ends: 606 [2018-02-04 17:41:09,114 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 17:41:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-02-04 17:41:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 564. [2018-02-04 17:41:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-02-04 17:41:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 756 transitions. [2018-02-04 17:41:09,118 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 756 transitions. Word has length 193 [2018-02-04 17:41:09,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:09,118 INFO L432 AbstractCegarLoop]: Abstraction has 564 states and 756 transitions. [2018-02-04 17:41:09,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:41:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 756 transitions. [2018-02-04 17:41:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-04 17:41:09,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:09,119 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:09,119 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:09,120 INFO L82 PathProgramCache]: Analyzing trace with hash 958478525, now seen corresponding path program 38 times [2018-02-04 17:41:09,120 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:09,120 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:09,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:09,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:41:09,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:09,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:09,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:09,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:09,668 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:41:09,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:41:09,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:09,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:10,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:10,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 80 [2018-02-04 17:41:10,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 17:41:10,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 17:41:10,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1640, Invalid=4840, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 17:41:10,167 INFO L87 Difference]: Start difference. First operand 564 states and 756 transitions. Second operand 81 states. [2018-02-04 17:41:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:16,782 INFO L93 Difference]: Finished difference Result 621 states and 820 transitions. [2018-02-04 17:41:16,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:41:16,782 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 198 [2018-02-04 17:41:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:16,784 INFO L225 Difference]: With dead ends: 621 [2018-02-04 17:41:16,784 INFO L226 Difference]: Without dead ends: 621 [2018-02-04 17:41:16,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2923 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1640, Invalid=4840, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 17:41:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-02-04 17:41:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 578. [2018-02-04 17:41:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-04 17:41:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 775 transitions. [2018-02-04 17:41:16,788 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 775 transitions. Word has length 198 [2018-02-04 17:41:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:16,788 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 775 transitions. [2018-02-04 17:41:16,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 17:41:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 775 transitions. [2018-02-04 17:41:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-02-04 17:41:16,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:16,789 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:16,789 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash 683771407, now seen corresponding path program 39 times [2018-02-04 17:41:16,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:16,789 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:16,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:16,790 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:16,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:16,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:17,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:17,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:17,262 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:41:17,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 17:41:17,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:17,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:17,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:17,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 82 [2018-02-04 17:41:17,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-02-04 17:41:17,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-02-04 17:41:17,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 17:41:17,864 INFO L87 Difference]: Start difference. First operand 578 states and 775 transitions. Second operand 83 states. [2018-02-04 17:41:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:23,599 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2018-02-04 17:41:23,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 17:41:23,599 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 203 [2018-02-04 17:41:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:23,601 INFO L225 Difference]: With dead ends: 636 [2018-02-04 17:41:23,601 INFO L226 Difference]: Without dead ends: 636 [2018-02-04 17:41:23,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 17:41:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-02-04 17:41:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 592. [2018-02-04 17:41:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-02-04 17:41:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 794 transitions. [2018-02-04 17:41:23,608 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 794 transitions. Word has length 203 [2018-02-04 17:41:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:23,608 INFO L432 AbstractCegarLoop]: Abstraction has 592 states and 794 transitions. [2018-02-04 17:41:23,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-02-04 17:41:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 794 transitions. [2018-02-04 17:41:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-02-04 17:41:23,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:23,610 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:23,610 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash -298402819, now seen corresponding path program 40 times [2018-02-04 17:41:23,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:23,610 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:23,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:23,611 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:23,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:23,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:24,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:24,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:24,245 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:41:24,294 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:41:24,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:24,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:24,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:24,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 52 [2018-02-04 17:41:24,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:41:24,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:41:24,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:41:24,490 INFO L87 Difference]: Start difference. First operand 592 states and 794 transitions. Second operand 53 states. [2018-02-04 17:41:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:26,582 INFO L93 Difference]: Finished difference Result 651 states and 860 transitions. [2018-02-04 17:41:26,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 17:41:26,583 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 208 [2018-02-04 17:41:26,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:26,584 INFO L225 Difference]: With dead ends: 651 [2018-02-04 17:41:26,584 INFO L226 Difference]: Without dead ends: 651 [2018-02-04 17:41:26,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2707, Invalid=5849, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 17:41:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-02-04 17:41:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 606. [2018-02-04 17:41:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-02-04 17:41:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 813 transitions. [2018-02-04 17:41:26,590 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 813 transitions. Word has length 208 [2018-02-04 17:41:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:26,590 INFO L432 AbstractCegarLoop]: Abstraction has 606 states and 813 transitions. [2018-02-04 17:41:26,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:41:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 813 transitions. [2018-02-04 17:41:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-04 17:41:26,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:26,592 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:26,592 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1356597967, now seen corresponding path program 41 times [2018-02-04 17:41:26,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:26,593 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:26,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:26,593 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:26,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:26,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:27,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:27,090 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:27,090 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:41:27,137 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 17:41:27,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:27,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:27,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:27,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2018-02-04 17:41:27,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-02-04 17:41:27,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-02-04 17:41:27,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 17:41:27,822 INFO L87 Difference]: Start difference. First operand 606 states and 813 transitions. Second operand 87 states. [2018-02-04 17:41:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:34,467 INFO L93 Difference]: Finished difference Result 666 states and 880 transitions. [2018-02-04 17:41:34,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 17:41:34,467 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 213 [2018-02-04 17:41:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:34,468 INFO L225 Difference]: With dead ends: 666 [2018-02-04 17:41:34,468 INFO L226 Difference]: Without dead ends: 666 [2018-02-04 17:41:34,468 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 17:41:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-02-04 17:41:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 620. [2018-02-04 17:41:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-04 17:41:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 832 transitions. [2018-02-04 17:41:34,472 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 832 transitions. Word has length 213 [2018-02-04 17:41:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:34,473 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 832 transitions. [2018-02-04 17:41:34,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-02-04 17:41:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 832 transitions. [2018-02-04 17:41:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-02-04 17:41:34,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:34,474 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:34,474 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:34,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1303457597, now seen corresponding path program 42 times [2018-02-04 17:41:34,474 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:34,474 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:34,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:34,474 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:34,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:34,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:35,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:35,007 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:35,007 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:41:35,111 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 17:41:35,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:35,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:35,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:35,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44] total 88 [2018-02-04 17:41:35,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-02-04 17:41:35,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-02-04 17:41:35,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=5852, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 17:41:35,741 INFO L87 Difference]: Start difference. First operand 620 states and 832 transitions. Second operand 89 states. [2018-02-04 17:41:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:43,670 INFO L93 Difference]: Finished difference Result 681 states and 900 transitions. [2018-02-04 17:41:43,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 17:41:43,670 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 218 [2018-02-04 17:41:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:43,672 INFO L225 Difference]: With dead ends: 681 [2018-02-04 17:41:43,672 INFO L226 Difference]: Without dead ends: 681 [2018-02-04 17:41:43,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1980, Invalid=5852, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 17:41:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-02-04 17:41:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 634. [2018-02-04 17:41:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-02-04 17:41:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 851 transitions. [2018-02-04 17:41:43,676 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 851 transitions. Word has length 218 [2018-02-04 17:41:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:43,676 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 851 transitions. [2018-02-04 17:41:43,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-02-04 17:41:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 851 transitions. [2018-02-04 17:41:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-04 17:41:43,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:43,678 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:43,678 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash 942120847, now seen corresponding path program 43 times [2018-02-04 17:41:43,678 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:43,678 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:43,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:43,678 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:43,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:43,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:44,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:44,232 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:44,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:41:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:44,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:44,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:44,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-02-04 17:41:44,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:41:44,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:41:44,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:41:44,275 INFO L87 Difference]: Start difference. First operand 634 states and 851 transitions. Second operand 47 states. [2018-02-04 17:41:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:45,882 INFO L93 Difference]: Finished difference Result 696 states and 920 transitions. [2018-02-04 17:41:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:41:45,882 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 223 [2018-02-04 17:41:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:45,883 INFO L225 Difference]: With dead ends: 696 [2018-02-04 17:41:45,883 INFO L226 Difference]: Without dead ends: 696 [2018-02-04 17:41:45,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 17:41:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-02-04 17:41:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 648. [2018-02-04 17:41:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-02-04 17:41:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 870 transitions. [2018-02-04 17:41:45,888 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 870 transitions. Word has length 223 [2018-02-04 17:41:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:45,888 INFO L432 AbstractCegarLoop]: Abstraction has 648 states and 870 transitions. [2018-02-04 17:41:45,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:41:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 870 transitions. [2018-02-04 17:41:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-02-04 17:41:45,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:45,889 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:45,889 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash 304386685, now seen corresponding path program 44 times [2018-02-04 17:41:45,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:45,890 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:45,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:45,890 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:41:45,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:45,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:46,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:46,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:46,512 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:41:46,522 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:41:46,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:46,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:46,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:46,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-02-04 17:41:46,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 17:41:46,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 17:41:46,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:41:46,720 INFO L87 Difference]: Start difference. First operand 648 states and 870 transitions. Second operand 55 states. [2018-02-04 17:41:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:48,848 INFO L93 Difference]: Finished difference Result 711 states and 940 transitions. [2018-02-04 17:41:48,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 17:41:48,848 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 228 [2018-02-04 17:41:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:48,850 INFO L225 Difference]: With dead ends: 711 [2018-02-04 17:41:48,850 INFO L226 Difference]: Without dead ends: 711 [2018-02-04 17:41:48,850 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 17:41:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-02-04 17:41:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 662. [2018-02-04 17:41:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-02-04 17:41:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 889 transitions. [2018-02-04 17:41:48,855 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 889 transitions. Word has length 228 [2018-02-04 17:41:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:48,855 INFO L432 AbstractCegarLoop]: Abstraction has 662 states and 889 transitions. [2018-02-04 17:41:48,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 17:41:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 889 transitions. [2018-02-04 17:41:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 17:41:48,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:48,857 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:48,857 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1601158065, now seen corresponding path program 45 times [2018-02-04 17:41:48,857 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:48,857 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:48,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:48,858 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:48,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:48,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:49,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:49,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:49,558 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:41:49,661 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 17:41:49,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:49,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:50,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:50,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 94 [2018-02-04 17:41:50,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-02-04 17:41:50,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-02-04 17:41:50,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 17:41:50,317 INFO L87 Difference]: Start difference. First operand 662 states and 889 transitions. Second operand 95 states. [2018-02-04 17:41:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:59,374 INFO L93 Difference]: Finished difference Result 726 states and 960 transitions. [2018-02-04 17:41:59,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 17:41:59,374 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 233 [2018-02-04 17:41:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:59,375 INFO L225 Difference]: With dead ends: 726 [2018-02-04 17:41:59,375 INFO L226 Difference]: Without dead ends: 726 [2018-02-04 17:41:59,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 17:41:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-02-04 17:41:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 676. [2018-02-04 17:41:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-02-04 17:41:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 908 transitions. [2018-02-04 17:41:59,383 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 908 transitions. Word has length 233 [2018-02-04 17:41:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:59,384 INFO L432 AbstractCegarLoop]: Abstraction has 676 states and 908 transitions. [2018-02-04 17:41:59,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-02-04 17:41:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 908 transitions. [2018-02-04 17:41:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-04 17:41:59,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:59,386 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:59,386 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:59,386 INFO L82 PathProgramCache]: Analyzing trace with hash -853219907, now seen corresponding path program 46 times [2018-02-04 17:41:59,386 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:59,387 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:59,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:59,387 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:59,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:59,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:00,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:00,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:00,027 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:42:00,075 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:42:00,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:00,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:00,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:00,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 52 [2018-02-04 17:42:00,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:42:00,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:42:00,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1146, Invalid=1610, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:42:00,188 INFO L87 Difference]: Start difference. First operand 676 states and 908 transitions. Second operand 53 states. [2018-02-04 17:42:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:02,529 INFO L93 Difference]: Finished difference Result 741 states and 980 transitions. [2018-02-04 17:42:02,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:42:02,530 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 238 [2018-02-04 17:42:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:02,531 INFO L225 Difference]: With dead ends: 741 [2018-02-04 17:42:02,531 INFO L226 Difference]: Without dead ends: 741 [2018-02-04 17:42:02,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3490, Invalid=6212, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 17:42:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-02-04 17:42:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 690. [2018-02-04 17:42:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-02-04 17:42:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 927 transitions. [2018-02-04 17:42:02,536 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 927 transitions. Word has length 238 [2018-02-04 17:42:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:02,536 INFO L432 AbstractCegarLoop]: Abstraction has 690 states and 927 transitions. [2018-02-04 17:42:02,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:42:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 927 transitions. [2018-02-04 17:42:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-02-04 17:42:02,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:02,538 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:02,538 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:02,538 INFO L82 PathProgramCache]: Analyzing trace with hash -721290993, now seen corresponding path program 47 times [2018-02-04 17:42:02,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:02,538 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:02,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:02,539 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:02,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:02,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:03,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:03,211 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:03,212 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:42:03,275 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 17:42:03,275 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:03,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:03,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:03,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2018-02-04 17:42:03,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-02-04 17:42:03,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-02-04 17:42:03,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 17:42:03,991 INFO L87 Difference]: Start difference. First operand 690 states and 927 transitions. Second operand 99 states. [2018-02-04 17:42:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:16,652 INFO L93 Difference]: Finished difference Result 756 states and 1000 transitions. [2018-02-04 17:42:16,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:42:16,652 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 243 [2018-02-04 17:42:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:16,654 INFO L225 Difference]: With dead ends: 756 [2018-02-04 17:42:16,654 INFO L226 Difference]: Without dead ends: 756 [2018-02-04 17:42:16,654 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 17:42:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-04 17:42:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 704. [2018-02-04 17:42:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-02-04 17:42:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 946 transitions. [2018-02-04 17:42:16,658 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 946 transitions. Word has length 243 [2018-02-04 17:42:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:16,659 INFO L432 AbstractCegarLoop]: Abstraction has 704 states and 946 transitions. [2018-02-04 17:42:16,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-02-04 17:42:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 946 transitions. [2018-02-04 17:42:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-02-04 17:42:16,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:16,660 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:16,660 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:16,660 INFO L82 PathProgramCache]: Analyzing trace with hash 658909437, now seen corresponding path program 48 times [2018-02-04 17:42:16,660 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:16,660 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:16,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:16,661 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:16,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:16,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:17,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:17,312 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:17,312 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:42:17,375 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 17:42:17,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:17,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:18,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:18,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50] total 100 [2018-02-04 17:42:18,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-02-04 17:42:18,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-02-04 17:42:18,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1850, Invalid=8250, Unknown=0, NotChecked=0, Total=10100 [2018-02-04 17:42:18,383 INFO L87 Difference]: Start difference. First operand 704 states and 946 transitions. Second operand 101 states. [2018-02-04 17:42:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:29,163 INFO L93 Difference]: Finished difference Result 771 states and 1020 transitions. [2018-02-04 17:42:29,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 17:42:29,163 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 248 [2018-02-04 17:42:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:29,164 INFO L225 Difference]: With dead ends: 771 [2018-02-04 17:42:29,165 INFO L226 Difference]: Without dead ends: 771 [2018-02-04 17:42:29,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3848 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1850, Invalid=8250, Unknown=0, NotChecked=0, Total=10100 [2018-02-04 17:42:29,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-02-04 17:42:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 718. [2018-02-04 17:42:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-02-04 17:42:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 965 transitions. [2018-02-04 17:42:29,170 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 965 transitions. Word has length 248 [2018-02-04 17:42:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:29,170 INFO L432 AbstractCegarLoop]: Abstraction has 718 states and 965 transitions. [2018-02-04 17:42:29,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-02-04 17:42:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 965 transitions. [2018-02-04 17:42:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-04 17:42:29,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:29,171 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:29,171 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1768472015, now seen corresponding path program 49 times [2018-02-04 17:42:29,172 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:29,172 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:29,172 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:29,172 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:29,172 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:29,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:29,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:29,939 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:29,939 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:29,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:30,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:30,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-02-04 17:42:30,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:42:30,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:42:30,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:42:30,016 INFO L87 Difference]: Start difference. First operand 718 states and 965 transitions. Second operand 53 states. [2018-02-04 17:42:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:31,979 INFO L93 Difference]: Finished difference Result 786 states and 1040 transitions. [2018-02-04 17:42:31,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:42:31,979 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 253 [2018-02-04 17:42:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:31,981 INFO L225 Difference]: With dead ends: 786 [2018-02-04 17:42:31,981 INFO L226 Difference]: Without dead ends: 786 [2018-02-04 17:42:31,981 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 17:42:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2018-02-04 17:42:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 732. [2018-02-04 17:42:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-02-04 17:42:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 984 transitions. [2018-02-04 17:42:31,986 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 984 transitions. Word has length 253 [2018-02-04 17:42:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:31,986 INFO L432 AbstractCegarLoop]: Abstraction has 732 states and 984 transitions. [2018-02-04 17:42:31,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:42:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 984 transitions. [2018-02-04 17:42:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-02-04 17:42:31,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:31,987 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:31,987 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash 538729533, now seen corresponding path program 50 times [2018-02-04 17:42:31,988 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:31,988 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:31,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:31,988 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:31,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:32,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:32,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:32,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:32,745 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:32,757 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:42:32,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:32,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:32,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:32,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-02-04 17:42:32,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 17:42:32,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 17:42:32,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:42:32,879 INFO L87 Difference]: Start difference. First operand 732 states and 984 transitions. Second operand 58 states. [2018-02-04 17:42:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:35,164 INFO L93 Difference]: Finished difference Result 801 states and 1060 transitions. [2018-02-04 17:42:35,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 17:42:35,164 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 258 [2018-02-04 17:42:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:35,166 INFO L225 Difference]: With dead ends: 801 [2018-02-04 17:42:35,166 INFO L226 Difference]: Without dead ends: 801 [2018-02-04 17:42:35,166 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 17:42:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-02-04 17:42:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 746. [2018-02-04 17:42:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-02-04 17:42:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1003 transitions. [2018-02-04 17:42:35,171 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1003 transitions. Word has length 258 [2018-02-04 17:42:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:35,171 INFO L432 AbstractCegarLoop]: Abstraction has 746 states and 1003 transitions. [2018-02-04 17:42:35,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 17:42:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1003 transitions. [2018-02-04 17:42:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-02-04 17:42:35,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:35,173 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:35,173 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash -89091441, now seen corresponding path program 51 times [2018-02-04 17:42:35,173 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:35,173 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:35,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:35,174 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:35,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:35,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:35,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:35,941 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:35,941 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:42:36,006 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 17:42:36,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:36,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:36,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:36,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53] total 106 [2018-02-04 17:42:36,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-02-04 17:42:36,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-02-04 17:42:36,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 17:42:36,719 INFO L87 Difference]: Start difference. First operand 746 states and 1003 transitions. Second operand 107 states. Received shutdown request... [2018-02-04 17:42:38,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:42:38,926 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:42:38,930 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:42:38,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:42:38 BoogieIcfgContainer [2018-02-04 17:42:38,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:42:38,930 INFO L168 Benchmark]: Toolchain (without parser) took 169539.55 ms. Allocated memory was 391.1 MB in the beginning and 965.7 MB in the end (delta: 574.6 MB). Free memory was 349.1 MB in the beginning and 759.3 MB in the end (delta: -410.2 MB). Peak memory consumption was 164.4 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:38,931 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 391.1 MB. Free memory is still 354.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:42:38,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.36 ms. Allocated memory is still 391.1 MB. Free memory was 349.1 MB in the beginning and 341.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:38,932 INFO L168 Benchmark]: Boogie Preprocessor took 23.74 ms. Allocated memory is still 391.1 MB. Free memory was 341.1 MB in the beginning and 339.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:38,932 INFO L168 Benchmark]: RCFGBuilder took 143.30 ms. Allocated memory is still 391.1 MB. Free memory was 339.7 MB in the beginning and 323.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:38,932 INFO L168 Benchmark]: TraceAbstraction took 169215.32 ms. Allocated memory was 391.1 MB in the beginning and 965.7 MB in the end (delta: 574.6 MB). Free memory was 323.8 MB in the beginning and 759.3 MB in the end (delta: -435.5 MB). Peak memory consumption was 139.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:38,933 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 391.1 MB. Free memory is still 354.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.36 ms. Allocated memory is still 391.1 MB. Free memory was 349.1 MB in the beginning and 341.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.74 ms. Allocated memory is still 391.1 MB. Free memory was 341.1 MB in the beginning and 339.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 143.30 ms. Allocated memory is still 391.1 MB. Free memory was 339.7 MB in the beginning and 323.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 169215.32 ms. Allocated memory was 391.1 MB in the beginning and 965.7 MB in the end (delta: 574.6 MB). Free memory was 323.8 MB in the beginning and 759.3 MB in the end (delta: -435.5 MB). Peak memory consumption was 139.2 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 17 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (226 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 17 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (226 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 17 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (226 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 17 states, 107 states before enhancement), while ReachableStatesComputation was computing reachable states (226 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 4 error locations. TIMEOUT Result, 169.1s OverallTime, 52 OverallIterations, 52 TraceHistogramMax, 135.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7884 SDtfs, 51949 SDslu, 158176 SDs, 0 SdLazy, 503623 SolverSat, 17933 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9035 GetRequests, 6243 SyntacticMatches, 4 SemanticMatches, 2788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61312 ImplicationChecksByTransitivity, 32.8s 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.3s AutomataMinimizationTime, 51 MinimizatonAttempts, 1530 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 29.8s 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_17-42-38-938.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_17-42-38-938.csv Completed graceful shutdown