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-a74eeac-m [2018-02-02 21:00:11,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:00:11,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:00:11,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:00:11,569 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:00:11,570 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:00:11,571 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:00:11,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:00:11,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:00:11,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:00:11,575 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:00:11,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:00:11,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:00:11,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:00:11,578 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:00:11,580 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:00:11,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:00:11,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:00:11,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:00:11,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:00:11,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:00:11,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:00:11,587 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:00:11,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:00:11,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:00:11,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:00:11,590 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:00:11,591 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:00:11,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:00:11,591 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:00:11,592 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:00:11,592 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 21:00:11,602 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:00:11,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:00:11,603 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:00:11,604 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:00:11,604 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:00:11,604 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:00:11,604 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:00:11,604 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:00:11,604 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:00:11,605 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:00:11,605 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:00:11,605 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:00:11,605 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:00:11,605 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:00:11,605 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:00:11,606 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:00:11,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:00:11,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:00:11,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:00:11,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:00:11,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:00:11,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:00:11,607 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:00:11,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:00:11,607 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:00:11,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:00:11,647 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:00:11,650 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:00:11,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:00:11,654 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:00:11,655 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-02 21:00:11,752 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:00:11,753 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:00:11,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:00:11,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:00:11,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:00:11,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:00:11" (1/1) ... [2018-02-02 21:00:11,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357a6e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11, skipping insertion in model container [2018-02-02 21:00:11,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:00:11" (1/1) ... [2018-02-02 21:00:11,771 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:00:11,782 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:00:11,886 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:00:11,895 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:00:11,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11 WrapperNode [2018-02-02 21:00:11,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:00:11,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:00:11,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:00:11,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:00:11,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11" (1/1) ... [2018-02-02 21:00:11,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11" (1/1) ... [2018-02-02 21:00:11,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11" (1/1) ... [2018-02-02 21:00:11,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11" (1/1) ... [2018-02-02 21:00:11,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11" (1/1) ... [2018-02-02 21:00:11,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11" (1/1) ... [2018-02-02 21:00:11,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11" (1/1) ... [2018-02-02 21:00:11,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:00:11,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:00:11,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:00:11,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:00:11,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:00:11,962 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:00:11,962 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:00:11,962 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 21:00:11,962 INFO L136 BoogieDeclarations]: Found implementation of procedure printEven [2018-02-02 21:00:11,962 INFO L136 BoogieDeclarations]: Found implementation of procedure printOdd [2018-02-02 21:00:11,962 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:00:11,962 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 21:00:11,962 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 21:00:11,963 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:00:11,963 INFO L128 BoogieDeclarations]: Found specification of procedure printEven [2018-02-02 21:00:11,963 INFO L128 BoogieDeclarations]: Found specification of procedure printOdd [2018-02-02 21:00:11,963 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:00:11,963 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:00:11,963 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:00:12,069 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:00:12,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:00:12 BoogieIcfgContainer [2018-02-02 21:00:12,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:00:12,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:00:12,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:00:12,073 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:00:12,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:00:11" (1/3) ... [2018-02-02 21:00:12,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6251ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:00:12, skipping insertion in model container [2018-02-02 21:00:12,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:11" (2/3) ... [2018-02-02 21:00:12,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6251ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:00:12, skipping insertion in model container [2018-02-02 21:00:12,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:00:12" (3/3) ... [2018-02-02 21:00:12,075 INFO L107 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i [2018-02-02 21:00:12,081 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:00:12,086 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-02-02 21:00:12,110 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:00:12,110 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:00:12,110 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:00:12,110 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:00:12,110 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:00:12,110 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:00:12,110 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:00:12,110 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:00:12,111 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:00:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-02-02 21:00:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 21:00:12,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:12,126 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:12,127 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash 529177341, now seen corresponding path program 1 times [2018-02-02 21:00:12,133 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:12,134 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:12,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:12,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:12,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:12,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:12,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:00:12,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:00:12,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:00:12,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:00:12,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:00:12,267 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-02-02 21:00:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:12,357 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-02-02 21:00:12,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:00:12,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-02 21:00:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:12,364 INFO L225 Difference]: With dead ends: 60 [2018-02-02 21:00:12,364 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 21:00:12,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:00:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 21:00:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-02 21:00:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 21:00:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-02-02 21:00:12,433 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2018-02-02 21:00:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:12,434 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-02-02 21:00:12,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:00:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-02-02 21:00:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 21:00:12,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:12,435 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:12,435 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2078569521, now seen corresponding path program 1 times [2018-02-02 21:00:12,435 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:12,435 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:12,436 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:12,436 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:12,436 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:12,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:12,490 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-02 21:00:12,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:12,490 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:12,491 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:12,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:12,522 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-02 21:00:12,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:12,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-02 21:00:12,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:00:12,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:00:12,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:00:12,525 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-02-02 21:00:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:12,597 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-02-02 21:00:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:00:12,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 21:00:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:12,599 INFO L225 Difference]: With dead ends: 66 [2018-02-02 21:00:12,599 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 21:00:12,599 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-02 21:00:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 21:00:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-02-02 21:00:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 21:00:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-02-02 21:00:12,606 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 13 [2018-02-02 21:00:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:12,607 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-02-02 21:00:12,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:00:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-02-02 21:00:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 21:00:12,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:12,608 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:12,608 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:12,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1794788925, now seen corresponding path program 2 times [2018-02-02 21:00:12,608 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:12,609 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:12,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:12,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:12,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:12,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:12,697 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-02 21:00:12,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:12,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:12,698 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:12,710 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:12,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:12,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:12,720 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-02 21:00:12,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:12,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-02 21:00:12,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:00:12,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:00:12,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:00:12,722 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 5 states. [2018-02-02 21:00:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:12,896 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-02-02 21:00:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:00:12,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 21:00:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:12,898 INFO L225 Difference]: With dead ends: 81 [2018-02-02 21:00:12,898 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 21:00:12,899 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-02 21:00:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 21:00:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-02-02 21:00:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 21:00:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-02 21:00:12,907 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 18 [2018-02-02 21:00:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:12,908 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-02 21:00:12,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:00:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-02 21:00:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 21:00:12,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:12,909 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:12,909 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash -424025969, now seen corresponding path program 3 times [2018-02-02 21:00:12,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:12,910 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:12,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:12,911 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:12,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:12,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:12,976 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-02 21:00:12,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:12,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:12,978 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:12,996 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-02 21:00:12,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:12,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:13,027 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-02 21:00:13,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:13,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-02-02 21:00:13,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:00:13,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:00:13,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:00:13,028 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 11 states. [2018-02-02 21:00:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:13,203 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-02-02 21:00:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:00:13,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 21:00:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:13,204 INFO L225 Difference]: With dead ends: 96 [2018-02-02 21:00:13,204 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 21:00:13,204 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-02 21:00:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 21:00:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2018-02-02 21:00:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 21:00:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2018-02-02 21:00:13,212 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 23 [2018-02-02 21:00:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:13,212 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2018-02-02 21:00:13,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:00:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2018-02-02 21:00:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 21:00:13,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:13,213 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:13,213 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:13,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1714228867, now seen corresponding path program 4 times [2018-02-02 21:00:13,214 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:13,214 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:13,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:13,215 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:13,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:13,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:13,296 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-02 21:00:13,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:13,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:13,297 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:13,317 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:13,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:13,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:13,377 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-02 21:00:13,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:13,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-02-02 21:00:13,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:00:13,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:00:13,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:00:13,378 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand 13 states. [2018-02-02 21:00:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:13,620 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2018-02-02 21:00:13,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:00:13,620 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-02 21:00:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:13,621 INFO L225 Difference]: With dead ends: 111 [2018-02-02 21:00:13,621 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 21:00:13,621 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:00:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 21:00:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2018-02-02 21:00:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 21:00:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2018-02-02 21:00:13,629 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 129 transitions. Word has length 28 [2018-02-02 21:00:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:13,629 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 129 transitions. [2018-02-02 21:00:13,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:00:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 129 transitions. [2018-02-02 21:00:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 21:00:13,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:13,631 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:13,631 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:13,631 INFO L82 PathProgramCache]: Analyzing trace with hash -771406513, now seen corresponding path program 5 times [2018-02-02 21:00:13,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:13,631 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:13,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:13,632 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:13,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:13,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:13,701 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-02 21:00:13,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:13,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:13,701 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:13,720 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-02 21:00:13,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:13,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:13,775 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-02 21:00:13,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:13,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-02-02 21:00:13,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 21:00:13,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 21:00:13,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:00:13,776 INFO L87 Difference]: Start difference. First operand 102 states and 129 transitions. Second operand 15 states. [2018-02-02 21:00:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:14,110 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2018-02-02 21:00:14,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:00:14,111 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-02-02 21:00:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:14,112 INFO L225 Difference]: With dead ends: 126 [2018-02-02 21:00:14,112 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 21:00:14,112 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-02 21:00:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 21:00:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-02-02 21:00:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 21:00:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2018-02-02 21:00:14,119 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 33 [2018-02-02 21:00:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:14,119 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2018-02-02 21:00:14,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 21:00:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2018-02-02 21:00:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 21:00:14,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:14,121 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:14,121 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:14,121 INFO L82 PathProgramCache]: Analyzing trace with hash -240614211, now seen corresponding path program 6 times [2018-02-02 21:00:14,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:14,121 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:14,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,122 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:14,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:14,181 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-02 21:00:14,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:14,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:14,182 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:14,198 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-02 21:00:14,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:14,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:14,231 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-02 21:00:14,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:14,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-02-02 21:00:14,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:00:14,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:00:14,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:00:14,232 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 13 states. [2018-02-02 21:00:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:14,431 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-02-02 21:00:14,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:00:14,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-02 21:00:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:14,432 INFO L225 Difference]: With dead ends: 141 [2018-02-02 21:00:14,432 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 21:00:14,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:00:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 21:00:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-02-02 21:00:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 21:00:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2018-02-02 21:00:14,438 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 38 [2018-02-02 21:00:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:14,439 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2018-02-02 21:00:14,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:00:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2018-02-02 21:00:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 21:00:14,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:14,440 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:14,440 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:14,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1558821391, now seen corresponding path program 7 times [2018-02-02 21:00:14,440 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:14,441 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:14,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,441 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:14,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:14,521 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-02 21:00:14,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:14,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:14,522 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:14,545 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-02 21:00:14,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:14,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-02 21:00:14,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:00:14,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:00:14,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:00:14,547 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand 11 states. [2018-02-02 21:00:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:14,790 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2018-02-02 21:00:14,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:00:14,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-02-02 21:00:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:14,796 INFO L225 Difference]: With dead ends: 156 [2018-02-02 21:00:14,796 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 21:00:14,796 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-02 21:00:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 21:00:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2018-02-02 21:00:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 21:00:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2018-02-02 21:00:14,805 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 43 [2018-02-02 21:00:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:14,805 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2018-02-02 21:00:14,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:00:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2018-02-02 21:00:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 21:00:14,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:14,810 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:14,810 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash -821098499, now seen corresponding path program 8 times [2018-02-02 21:00:14,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:14,811 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:14,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:14,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:14,928 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-02 21:00:14,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:14,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:14,929 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:14,938 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:14,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:14,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:14,957 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-02 21:00:14,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:14,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-02 21:00:14,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:00:14,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:00:14,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:00:14,958 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand 11 states. [2018-02-02 21:00:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:15,562 INFO L93 Difference]: Finished difference Result 171 states and 220 transitions. [2018-02-02 21:00:15,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:00:15,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 21:00:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:15,564 INFO L225 Difference]: With dead ends: 171 [2018-02-02 21:00:15,564 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 21:00:15,564 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-02 21:00:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 21:00:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-02-02 21:00:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 21:00:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2018-02-02 21:00:15,569 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 48 [2018-02-02 21:00:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:15,569 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2018-02-02 21:00:15,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:00:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2018-02-02 21:00:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 21:00:15,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:15,571 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:15,571 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash -413974833, now seen corresponding path program 9 times [2018-02-02 21:00:15,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:15,571 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:15,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,575 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:15,575 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:15,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:15,667 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-02 21:00:15,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:15,667 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:15,668 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:15,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-02 21:00:15,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:15,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:15,691 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-02 21:00:15,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:15,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-02-02 21:00:15,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:00:15,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:00:15,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:00:15,692 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand 13 states. [2018-02-02 21:00:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:15,973 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2018-02-02 21:00:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:00:15,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-02 21:00:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:15,975 INFO L225 Difference]: With dead ends: 186 [2018-02-02 21:00:15,975 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 21:00:15,975 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-02 21:00:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 21:00:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-02-02 21:00:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 21:00:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2018-02-02 21:00:15,980 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 53 [2018-02-02 21:00:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:15,980 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2018-02-02 21:00:15,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:00:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2018-02-02 21:00:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 21:00:15,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:15,981 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:15,982 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash -442860739, now seen corresponding path program 10 times [2018-02-02 21:00:15,982 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:15,982 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:15,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,983 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:15,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:15,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:16,093 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-02 21:00:16,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:16,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:16,094 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:16,121 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:16,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:16,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:16,159 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-02 21:00:16,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:16,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-02-02 21:00:16,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:00:16,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:00:16,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:00:16,160 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand 17 states. [2018-02-02 21:00:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:16,504 INFO L93 Difference]: Finished difference Result 201 states and 260 transitions. [2018-02-02 21:00:16,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 21:00:16,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-02 21:00:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:16,505 INFO L225 Difference]: With dead ends: 201 [2018-02-02 21:00:16,505 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 21:00:16,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:00:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 21:00:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 186. [2018-02-02 21:00:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 21:00:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2018-02-02 21:00:16,512 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 58 [2018-02-02 21:00:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:16,512 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2018-02-02 21:00:16,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:00:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2018-02-02 21:00:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 21:00:16,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:16,514 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:16,514 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash -634530929, now seen corresponding path program 11 times [2018-02-02 21:00:16,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:16,514 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:16,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,515 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:16,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:16,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:16,634 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-02 21:00:16,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:16,634 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:16,634 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:16,654 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-02 21:00:16,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:16,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:16,788 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-02 21:00:16,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:16,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-02-02 21:00:16,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 21:00:16,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 21:00:16,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-02-02 21:00:16,789 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand 27 states. [2018-02-02 21:00:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:17,986 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2018-02-02 21:00:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:00:17,986 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-02-02 21:00:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:17,987 INFO L225 Difference]: With dead ends: 216 [2018-02-02 21:00:17,987 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 21:00:17,987 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-02 21:00:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 21:00:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2018-02-02 21:00:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 21:00:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2018-02-02 21:00:17,994 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 63 [2018-02-02 21:00:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:17,994 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2018-02-02 21:00:17,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 21:00:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2018-02-02 21:00:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 21:00:17,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:17,996 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:17,996 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:17,996 INFO L82 PathProgramCache]: Analyzing trace with hash 2145312381, now seen corresponding path program 12 times [2018-02-02 21:00:17,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:17,996 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:17,997 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:17,997 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:17,997 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:18,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:18,106 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-02 21:00:18,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:18,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:18,107 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:18,139 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-02 21:00:18,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:18,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:18,325 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-02 21:00:18,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:18,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-02-02 21:00:18,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:00:18,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:00:18,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:00:18,327 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand 29 states. [2018-02-02 21:00:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:19,090 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2018-02-02 21:00:19,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 21:00:19,090 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 68 [2018-02-02 21:00:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:19,092 INFO L225 Difference]: With dead ends: 231 [2018-02-02 21:00:19,092 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 21:00:19,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:00:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 21:00:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2018-02-02 21:00:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 21:00:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 281 transitions. [2018-02-02 21:00:19,098 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 281 transitions. Word has length 68 [2018-02-02 21:00:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:19,098 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 281 transitions. [2018-02-02 21:00:19,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:00:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 281 transitions. [2018-02-02 21:00:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 21:00:19,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:19,100 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:19,100 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1734703183, now seen corresponding path program 13 times [2018-02-02 21:00:19,100 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:19,100 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:19,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:19,101 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:19,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:19,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:19,222 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-02 21:00:19,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:19,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:19,222 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:19,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:19,246 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-02 21:00:19,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:19,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-02-02 21:00:19,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:00:19,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:00:19,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:00:19,248 INFO L87 Difference]: Start difference. First operand 214 states and 281 transitions. Second operand 17 states. [2018-02-02 21:00:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:19,650 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2018-02-02 21:00:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 21:00:19,650 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-02-02 21:00:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:19,651 INFO L225 Difference]: With dead ends: 246 [2018-02-02 21:00:19,652 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 21:00:19,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-02 21:00:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 21:00:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2018-02-02 21:00:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 21:00:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 300 transitions. [2018-02-02 21:00:19,657 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 300 transitions. Word has length 73 [2018-02-02 21:00:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:19,657 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 300 transitions. [2018-02-02 21:00:19,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:00:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2018-02-02 21:00:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 21:00:19,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:19,658 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:19,659 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:19,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1083166275, now seen corresponding path program 14 times [2018-02-02 21:00:19,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:19,659 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:19,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:19,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:19,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:19,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:19,847 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-02 21:00:19,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:19,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:19,848 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:19,858 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:19,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:19,861 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:19,907 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-02 21:00:19,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:19,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-02-02 21:00:19,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 21:00:19,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 21:00:19,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2018-02-02 21:00:19,908 INFO L87 Difference]: Start difference. First operand 228 states and 300 transitions. Second operand 22 states. [2018-02-02 21:00:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:20,425 INFO L93 Difference]: Finished difference Result 261 states and 340 transitions. [2018-02-02 21:00:20,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:00:20,425 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2018-02-02 21:00:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:20,426 INFO L225 Difference]: With dead ends: 261 [2018-02-02 21:00:20,426 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 21:00:20,427 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-02 21:00:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 21:00:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 242. [2018-02-02 21:00:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 21:00:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 319 transitions. [2018-02-02 21:00:20,430 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 319 transitions. Word has length 78 [2018-02-02 21:00:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:20,430 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 319 transitions. [2018-02-02 21:00:20,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 21:00:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 319 transitions. [2018-02-02 21:00:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 21:00:20,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:20,432 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:20,432 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:20,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1239821583, now seen corresponding path program 15 times [2018-02-02 21:00:20,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:20,432 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:20,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:20,433 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:20,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:20,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:20,576 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-02 21:00:20,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:20,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:20,578 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:20,605 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-02 21:00:20,605 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:20,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:20,758 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-02 21:00:20,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:20,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-02 21:00:20,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:00:20,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:00:20,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:20,760 INFO L87 Difference]: Start difference. First operand 242 states and 319 transitions. Second operand 35 states. [2018-02-02 21:00:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:22,121 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2018-02-02 21:00:22,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 21:00:22,122 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 83 [2018-02-02 21:00:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:22,122 INFO L225 Difference]: With dead ends: 276 [2018-02-02 21:00:22,123 INFO L226 Difference]: Without dead ends: 276 [2018-02-02 21:00:22,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-02 21:00:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2018-02-02 21:00:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 21:00:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 338 transitions. [2018-02-02 21:00:22,129 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 338 transitions. Word has length 83 [2018-02-02 21:00:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:22,130 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 338 transitions. [2018-02-02 21:00:22,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:00:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 338 transitions. [2018-02-02 21:00:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 21:00:22,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:22,131 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:22,131 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash -589138691, now seen corresponding path program 16 times [2018-02-02 21:00:22,131 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:22,132 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:22,132 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:22,132 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:22,132 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:22,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:22,369 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-02 21:00:22,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:22,370 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:22,371 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:22,395 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:22,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:22,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:22,644 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-02 21:00:22,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:22,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2018-02-02 21:00:22,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:00:22,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:00:22,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:00:22,645 INFO L87 Difference]: Start difference. First operand 256 states and 338 transitions. Second operand 37 states. [2018-02-02 21:00:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:23,836 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2018-02-02 21:00:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 21:00:23,836 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 88 [2018-02-02 21:00:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:23,837 INFO L225 Difference]: With dead ends: 291 [2018-02-02 21:00:23,837 INFO L226 Difference]: Without dead ends: 291 [2018-02-02 21:00:23,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:00:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-02 21:00:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2018-02-02 21:00:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 21:00:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2018-02-02 21:00:23,844 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 88 [2018-02-02 21:00:23,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:23,844 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2018-02-02 21:00:23,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:00:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2018-02-02 21:00:23,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 21:00:23,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:23,845 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:23,845 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:23,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2053377585, now seen corresponding path program 17 times [2018-02-02 21:00:23,846 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:23,846 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:23,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:23,847 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:23,847 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:23,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:24,010 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-02 21:00:24,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:24,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:24,011 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:24,038 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-02 21:00:24,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:24,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:24,227 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-02 21:00:24,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:24,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-02-02 21:00:24,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 21:00:24,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 21:00:24,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 21:00:24,229 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand 39 states. [2018-02-02 21:00:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:26,084 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2018-02-02 21:00:26,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 21:00:26,084 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 93 [2018-02-02 21:00:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:26,085 INFO L225 Difference]: With dead ends: 306 [2018-02-02 21:00:26,085 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 21:00:26,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 21:00:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 21:00:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 284. [2018-02-02 21:00:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 21:00:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 376 transitions. [2018-02-02 21:00:26,090 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 376 transitions. Word has length 93 [2018-02-02 21:00:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:26,090 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 376 transitions. [2018-02-02 21:00:26,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 21:00:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 376 transitions. [2018-02-02 21:00:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 21:00:26,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:26,092 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:26,092 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1741269053, now seen corresponding path program 18 times [2018-02-02 21:00:26,092 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:26,092 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:26,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:26,093 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:26,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:26,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:26,247 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-02 21:00:26,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:26,247 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:26,248 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:26,276 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-02 21:00:26,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:26,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:26,486 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-02 21:00:26,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:26,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-02 21:00:26,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:00:26,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:00:26,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:00:26,488 INFO L87 Difference]: Start difference. First operand 284 states and 376 transitions. Second operand 41 states. [2018-02-02 21:00:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:28,022 INFO L93 Difference]: Finished difference Result 321 states and 420 transitions. [2018-02-02 21:00:28,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 21:00:28,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 98 [2018-02-02 21:00:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:28,023 INFO L225 Difference]: With dead ends: 321 [2018-02-02 21:00:28,023 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 21:00:28,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:00:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 21:00:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-02-02 21:00:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-02 21:00:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2018-02-02 21:00:28,027 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 98 [2018-02-02 21:00:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:28,027 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2018-02-02 21:00:28,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:00:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2018-02-02 21:00:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 21:00:28,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:28,029 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:28,029 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:28,029 INFO L82 PathProgramCache]: Analyzing trace with hash 661833359, now seen corresponding path program 19 times [2018-02-02 21:00:28,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:28,029 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:28,029 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:28,029 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:28,029 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:28,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:28,255 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-02 21:00:28,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:28,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:28,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:28,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:28,289 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-02 21:00:28,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:28,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-02-02 21:00:28,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:00:28,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:00:28,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:00:28,291 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand 23 states. [2018-02-02 21:00:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:28,798 INFO L93 Difference]: Finished difference Result 336 states and 440 transitions. [2018-02-02 21:00:28,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 21:00:28,798 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 103 [2018-02-02 21:00:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:28,799 INFO L225 Difference]: With dead ends: 336 [2018-02-02 21:00:28,799 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 21:00:28,800 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-02 21:00:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 21:00:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 312. [2018-02-02 21:00:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-02 21:00:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 414 transitions. [2018-02-02 21:00:28,803 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 414 transitions. Word has length 103 [2018-02-02 21:00:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:28,804 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 414 transitions. [2018-02-02 21:00:28,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:00:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 414 transitions. [2018-02-02 21:00:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 21:00:28,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:28,805 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:28,805 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2034644099, now seen corresponding path program 20 times [2018-02-02 21:00:28,805 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:28,805 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:28,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:28,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:28,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:28,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:29,047 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-02 21:00:29,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:29,048 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:29,048 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:29,060 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:29,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:29,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:29,156 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-02 21:00:29,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:29,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 28 [2018-02-02 21:00:29,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:00:29,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:00:29,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:00:29,157 INFO L87 Difference]: Start difference. First operand 312 states and 414 transitions. Second operand 29 states. [2018-02-02 21:00:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:29,932 INFO L93 Difference]: Finished difference Result 351 states and 460 transitions. [2018-02-02 21:00:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 21:00:29,933 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2018-02-02 21:00:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:29,934 INFO L225 Difference]: With dead ends: 351 [2018-02-02 21:00:29,934 INFO L226 Difference]: Without dead ends: 351 [2018-02-02 21:00:29,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=757, Invalid=1595, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 21:00:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-02 21:00:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 326. [2018-02-02 21:00:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-02 21:00:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2018-02-02 21:00:29,940 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 108 [2018-02-02 21:00:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:29,941 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2018-02-02 21:00:29,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:00:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2018-02-02 21:00:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 21:00:29,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:29,943 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:29,943 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:29,943 INFO L82 PathProgramCache]: Analyzing trace with hash 89566031, now seen corresponding path program 21 times [2018-02-02 21:00:29,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:29,943 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:29,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:29,945 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:29,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:29,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:30,161 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-02 21:00:30,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:30,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:30,161 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:30,183 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-02 21:00:30,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:30,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:30,507 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-02 21:00:30,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:30,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2018-02-02 21:00:30,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 21:00:30,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 21:00:30,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 21:00:30,508 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand 47 states. [2018-02-02 21:00:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:32,504 INFO L93 Difference]: Finished difference Result 366 states and 480 transitions. [2018-02-02 21:00:32,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 21:00:32,504 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 113 [2018-02-02 21:00:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:32,506 INFO L225 Difference]: With dead ends: 366 [2018-02-02 21:00:32,506 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 21:00:32,507 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-02 21:00:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 21:00:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 340. [2018-02-02 21:00:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-02 21:00:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 452 transitions. [2018-02-02 21:00:32,513 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 452 transitions. Word has length 113 [2018-02-02 21:00:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:32,513 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 452 transitions. [2018-02-02 21:00:32,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 21:00:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 452 transitions. [2018-02-02 21:00:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-02 21:00:32,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:32,514 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:32,514 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash 927391421, now seen corresponding path program 22 times [2018-02-02 21:00:32,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:32,514 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:32,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:32,514 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:32,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:32,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:32,705 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-02 21:00:32,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:32,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:32,706 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:32,729 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:32,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:32,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:32,792 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-02 21:00:32,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:32,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 28 [2018-02-02 21:00:32,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:00:32,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:00:32,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=518, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:00:32,793 INFO L87 Difference]: Start difference. First operand 340 states and 452 transitions. Second operand 29 states. [2018-02-02 21:00:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:33,564 INFO L93 Difference]: Finished difference Result 381 states and 500 transitions. [2018-02-02 21:00:33,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 21:00:33,565 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-02-02 21:00:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:33,565 INFO L225 Difference]: With dead ends: 381 [2018-02-02 21:00:33,566 INFO L226 Difference]: Without dead ends: 381 [2018-02-02 21:00:33,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=886, Invalid=1664, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 21:00:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-02 21:00:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 354. [2018-02-02 21:00:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-02 21:00:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2018-02-02 21:00:33,569 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 118 [2018-02-02 21:00:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:33,570 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2018-02-02 21:00:33,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:00:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2018-02-02 21:00:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-02 21:00:33,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:33,570 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:33,570 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:33,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2117312527, now seen corresponding path program 23 times [2018-02-02 21:00:33,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:33,571 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:33,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:33,571 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:33,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:33,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:33,816 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-02 21:00:33,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:33,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:33,817 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:33,842 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-02 21:00:33,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:33,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:34,202 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-02 21:00:34,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:34,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-02-02 21:00:34,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 21:00:34,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 21:00:34,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 21:00:34,204 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand 51 states. [2018-02-02 21:00:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:36,603 INFO L93 Difference]: Finished difference Result 396 states and 520 transitions. [2018-02-02 21:00:36,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 21:00:36,603 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 123 [2018-02-02 21:00:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:36,604 INFO L225 Difference]: With dead ends: 396 [2018-02-02 21:00:36,604 INFO L226 Difference]: Without dead ends: 396 [2018-02-02 21:00:36,604 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-02 21:00:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-02 21:00:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 368. [2018-02-02 21:00:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-02 21:00:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2018-02-02 21:00:36,608 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 123 [2018-02-02 21:00:36,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:36,608 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2018-02-02 21:00:36,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 21:00:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2018-02-02 21:00:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-02 21:00:36,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:36,609 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:36,609 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1912282627, now seen corresponding path program 24 times [2018-02-02 21:00:36,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:36,609 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:36,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:36,610 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:36,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:36,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:36,816 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-02 21:00:36,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:36,816 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:36,817 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:36,843 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-02 21:00:36,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:36,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:37,342 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-02 21:00:37,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:37,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2018-02-02 21:00:37,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 21:00:37,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 21:00:37,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 21:00:37,382 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand 53 states. [2018-02-02 21:00:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:39,982 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2018-02-02 21:00:39,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 21:00:39,982 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 128 [2018-02-02 21:00:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:39,983 INFO L225 Difference]: With dead ends: 411 [2018-02-02 21:00:39,983 INFO L226 Difference]: Without dead ends: 411 [2018-02-02 21:00:39,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 21:00:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-02 21:00:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 382. [2018-02-02 21:00:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 21:00:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 509 transitions. [2018-02-02 21:00:39,989 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 509 transitions. Word has length 128 [2018-02-02 21:00:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:39,989 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 509 transitions. [2018-02-02 21:00:39,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 21:00:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 509 transitions. [2018-02-02 21:00:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-02 21:00:39,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:39,991 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:39,991 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:39,991 INFO L82 PathProgramCache]: Analyzing trace with hash 972399823, now seen corresponding path program 25 times [2018-02-02 21:00:39,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:39,991 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:39,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:39,992 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:39,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:40,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:40,261 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-02 21:00:40,261 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:40,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:40,262 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:40,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:40,297 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-02 21:00:40,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:40,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-02-02 21:00:40,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:00:40,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:00:40,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:00:40,299 INFO L87 Difference]: Start difference. First operand 382 states and 509 transitions. Second operand 29 states. [2018-02-02 21:00:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:40,962 INFO L93 Difference]: Finished difference Result 426 states and 560 transitions. [2018-02-02 21:00:40,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 21:00:40,962 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-02-02 21:00:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:40,963 INFO L225 Difference]: With dead ends: 426 [2018-02-02 21:00:40,963 INFO L226 Difference]: Without dead ends: 426 [2018-02-02 21:00:40,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 21:00:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-02 21:00:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2018-02-02 21:00:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-02 21:00:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 528 transitions. [2018-02-02 21:00:40,970 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 528 transitions. Word has length 133 [2018-02-02 21:00:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:40,971 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 528 transitions. [2018-02-02 21:00:40,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:00:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 528 transitions. [2018-02-02 21:00:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-02-02 21:00:40,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:40,972 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:40,972 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash -158870211, now seen corresponding path program 26 times [2018-02-02 21:00:40,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:40,973 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:40,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:40,973 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:40,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:40,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:41,223 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-02 21:00:41,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:41,224 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:41,224 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:41,239 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:41,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:41,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:41,316 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-02 21:00:41,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:41,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 34 [2018-02-02 21:00:41,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:00:41,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:00:41,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=807, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:41,317 INFO L87 Difference]: Start difference. First operand 396 states and 528 transitions. Second operand 35 states. [2018-02-02 21:00:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:42,287 INFO L93 Difference]: Finished difference Result 441 states and 580 transitions. [2018-02-02 21:00:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 21:00:42,287 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2018-02-02 21:00:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:42,289 INFO L225 Difference]: With dead ends: 441 [2018-02-02 21:00:42,289 INFO L226 Difference]: Without dead ends: 441 [2018-02-02 21:00:42,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1179, Invalid=2481, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 21:00:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-02 21:00:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2018-02-02 21:00:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 21:00:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 547 transitions. [2018-02-02 21:00:42,297 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 547 transitions. Word has length 138 [2018-02-02 21:00:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:42,297 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 547 transitions. [2018-02-02 21:00:42,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:00:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 547 transitions. [2018-02-02 21:00:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-02 21:00:42,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:42,299 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:42,299 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:42,299 INFO L82 PathProgramCache]: Analyzing trace with hash -376915569, now seen corresponding path program 27 times [2018-02-02 21:00:42,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:42,300 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:42,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:42,300 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:42,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:42,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:42,626 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-02 21:00:42,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:42,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:42,627 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:42,665 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-02 21:00:42,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:42,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:42,968 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-02 21:00:42,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:42,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-02-02 21:00:42,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 21:00:42,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 21:00:42,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 21:00:42,970 INFO L87 Difference]: Start difference. First operand 410 states and 547 transitions. Second operand 59 states. [2018-02-02 21:00:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:46,635 INFO L93 Difference]: Finished difference Result 456 states and 600 transitions. [2018-02-02 21:00:46,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 21:00:46,635 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 143 [2018-02-02 21:00:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:46,636 INFO L225 Difference]: With dead ends: 456 [2018-02-02 21:00:46,636 INFO L226 Difference]: Without dead ends: 456 [2018-02-02 21:00:46,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 21:00:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-02 21:00:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 424. [2018-02-02 21:00:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 21:00:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 566 transitions. [2018-02-02 21:00:46,641 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 566 transitions. Word has length 143 [2018-02-02 21:00:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:46,641 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 566 transitions. [2018-02-02 21:00:46,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 21:00:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 566 transitions. [2018-02-02 21:00:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 21:00:46,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:46,643 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:46,643 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1935915133, now seen corresponding path program 28 times [2018-02-02 21:00:46,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:46,644 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:46,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:46,644 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:46,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:46,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:46,943 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-02 21:00:46,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:46,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:46,944 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:46,963 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:46,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:46,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:47,055 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-02 21:00:47,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:47,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 36 [2018-02-02 21:00:47,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:00:47,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:00:47,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=864, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:00:47,056 INFO L87 Difference]: Start difference. First operand 424 states and 566 transitions. Second operand 37 states. [2018-02-02 21:00:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:48,030 INFO L93 Difference]: Finished difference Result 471 states and 620 transitions. [2018-02-02 21:00:48,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 21:00:48,030 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 148 [2018-02-02 21:00:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:48,031 INFO L225 Difference]: With dead ends: 471 [2018-02-02 21:00:48,031 INFO L226 Difference]: Without dead ends: 471 [2018-02-02 21:00:48,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1385, Invalid=2775, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 21:00:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-02-02 21:00:48,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 438. [2018-02-02 21:00:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-02 21:00:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-02-02 21:00:48,040 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 148 [2018-02-02 21:00:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:48,040 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-02-02 21:00:48,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:00:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-02-02 21:00:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-02 21:00:48,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:48,041 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:48,041 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:48,041 INFO L82 PathProgramCache]: Analyzing trace with hash 114875983, now seen corresponding path program 29 times [2018-02-02 21:00:48,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:48,041 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:48,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:48,042 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:48,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:48,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:48,338 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-02 21:00:48,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:48,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:48,339 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:48,381 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-02 21:00:48,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:48,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:48,798 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-02 21:00:48,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:48,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2018-02-02 21:00:48,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-02 21:00:48,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-02 21:00:48,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 21:00:48,799 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 63 states. [2018-02-02 21:00:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:53,633 INFO L93 Difference]: Finished difference Result 486 states and 640 transitions. [2018-02-02 21:00:53,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 21:00:53,634 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 153 [2018-02-02 21:00:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:53,635 INFO L225 Difference]: With dead ends: 486 [2018-02-02 21:00:53,635 INFO L226 Difference]: Without dead ends: 486 [2018-02-02 21:00:53,635 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-02 21:00:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-02-02 21:00:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 452. [2018-02-02 21:00:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-02 21:00:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 604 transitions. [2018-02-02 21:00:53,640 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 604 transitions. Word has length 153 [2018-02-02 21:00:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:53,640 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 604 transitions. [2018-02-02 21:00:53,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-02 21:00:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 604 transitions. [2018-02-02 21:00:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-02 21:00:53,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:53,642 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:53,642 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:53,642 INFO L82 PathProgramCache]: Analyzing trace with hash -567505987, now seen corresponding path program 30 times [2018-02-02 21:00:53,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:53,643 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:53,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:53,643 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:53,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:53,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:54,031 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-02 21:00:54,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:54,031 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:54,032 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:54,062 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-02 21:00:54,062 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:54,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:54,490 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-02 21:00:54,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:54,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 64 [2018-02-02 21:00:54,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-02 21:00:54,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-02 21:00:54,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=3104, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 21:00:54,492 INFO L87 Difference]: Start difference. First operand 452 states and 604 transitions. Second operand 65 states. [2018-02-02 21:00:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:57,282 INFO L93 Difference]: Finished difference Result 501 states and 660 transitions. [2018-02-02 21:00:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 21:00:57,283 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 158 [2018-02-02 21:00:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:57,284 INFO L225 Difference]: With dead ends: 501 [2018-02-02 21:00:57,284 INFO L226 Difference]: Without dead ends: 501 [2018-02-02 21:00:57,284 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-02 21:00:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-02-02 21:00:57,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 466. [2018-02-02 21:00:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-02-02 21:00:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2018-02-02 21:00:57,288 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 623 transitions. Word has length 158 [2018-02-02 21:00:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:57,288 INFO L432 AbstractCegarLoop]: Abstraction has 466 states and 623 transitions. [2018-02-02 21:00:57,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-02 21:00:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 623 transitions. [2018-02-02 21:00:57,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-02 21:00:57,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:57,289 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:57,289 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:57,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1798171889, now seen corresponding path program 31 times [2018-02-02 21:00:57,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:57,290 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:57,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:57,290 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:57,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:57,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:57,597 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-02 21:00:57,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:57,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:57,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:57,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:57,639 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-02 21:00:57,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:57,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-02 21:00:57,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:00:57,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:00:57,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:57,641 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand 35 states. [2018-02-02 21:00:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:58,611 INFO L93 Difference]: Finished difference Result 516 states and 680 transitions. [2018-02-02 21:00:58,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 21:00:58,612 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2018-02-02 21:00:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:58,613 INFO L225 Difference]: With dead ends: 516 [2018-02-02 21:00:58,613 INFO L226 Difference]: Without dead ends: 516 [2018-02-02 21:00:58,613 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-02 21:00:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-02 21:00:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 480. [2018-02-02 21:00:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-02-02 21:00:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 642 transitions. [2018-02-02 21:00:58,617 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 642 transitions. Word has length 163 [2018-02-02 21:00:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:58,617 INFO L432 AbstractCegarLoop]: Abstraction has 480 states and 642 transitions. [2018-02-02 21:00:58,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:00:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 642 transitions. [2018-02-02 21:00:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-02 21:00:58,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:58,619 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:58,619 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash 662064893, now seen corresponding path program 32 times [2018-02-02 21:00:58,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:58,619 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:58,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:58,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:58,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:58,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:59,084 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-02 21:00:59,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:59,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:59,085 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:59,094 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:59,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:59,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:59,133 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-02 21:00:59,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:59,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-02 21:00:59,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:00:59,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:00:59,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:59,134 INFO L87 Difference]: Start difference. First operand 480 states and 642 transitions. Second operand 35 states. [2018-02-02 21:01:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:03,768 INFO L93 Difference]: Finished difference Result 531 states and 700 transitions. [2018-02-02 21:01:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 21:01:03,768 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 168 [2018-02-02 21:01:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:03,769 INFO L225 Difference]: With dead ends: 531 [2018-02-02 21:01:03,769 INFO L226 Difference]: Without dead ends: 531 [2018-02-02 21:01:03,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:01:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-02 21:01:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 494. [2018-02-02 21:01:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-02 21:01:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 661 transitions. [2018-02-02 21:01:03,774 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 661 transitions. Word has length 168 [2018-02-02 21:01:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:03,774 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 661 transitions. [2018-02-02 21:01:03,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:01:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 661 transitions. [2018-02-02 21:01:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-02 21:01:03,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:03,775 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:03,775 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:03,776 INFO L82 PathProgramCache]: Analyzing trace with hash -547334193, now seen corresponding path program 33 times [2018-02-02 21:01:03,776 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:03,776 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:03,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:03,776 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:03,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:03,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:04,283 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-02 21:01:04,284 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:04,284 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:04,284 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:01:04,314 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-02 21:01:04,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:04,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:04,706 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-02 21:01:04,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:04,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 70 [2018-02-02 21:01:04,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-02 21:01:04,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-02 21:01:04,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 21:01:04,708 INFO L87 Difference]: Start difference. First operand 494 states and 661 transitions. Second operand 71 states. [2018-02-02 21:01:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:09,233 INFO L93 Difference]: Finished difference Result 546 states and 720 transitions. [2018-02-02 21:01:09,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 21:01:09,234 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 173 [2018-02-02 21:01:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:09,235 INFO L225 Difference]: With dead ends: 546 [2018-02-02 21:01:09,236 INFO L226 Difference]: Without dead ends: 546 [2018-02-02 21:01:09,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 21:01:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-02 21:01:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 508. [2018-02-02 21:01:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-02 21:01:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 680 transitions. [2018-02-02 21:01:09,240 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 680 transitions. Word has length 173 [2018-02-02 21:01:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:09,240 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 680 transitions. [2018-02-02 21:01:09,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-02 21:01:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 680 transitions. [2018-02-02 21:01:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-02 21:01:09,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:09,242 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:09,242 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:09,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1764425155, now seen corresponding path program 34 times [2018-02-02 21:01:09,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:09,242 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:09,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:09,243 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:09,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:09,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:09,607 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-02 21:01:09,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:09,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:09,608 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:01:09,633 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:01:09,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:09,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:09,686 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-02 21:01:09,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:09,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 40 [2018-02-02 21:01:09,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:01:09,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:01:09,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=992, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:01:09,687 INFO L87 Difference]: Start difference. First operand 508 states and 680 transitions. Second operand 41 states. [2018-02-02 21:01:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:10,874 INFO L93 Difference]: Finished difference Result 561 states and 740 transitions. [2018-02-02 21:01:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 21:01:10,875 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-02-02 21:01:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:10,876 INFO L225 Difference]: With dead ends: 561 [2018-02-02 21:01:10,876 INFO L226 Difference]: Without dead ends: 561 [2018-02-02 21:01:10,876 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-02 21:01:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-02-02 21:01:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 522. [2018-02-02 21:01:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-02-02 21:01:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 699 transitions. [2018-02-02 21:01:10,880 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 699 transitions. Word has length 178 [2018-02-02 21:01:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:10,880 INFO L432 AbstractCegarLoop]: Abstraction has 522 states and 699 transitions. [2018-02-02 21:01:10,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:01:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 699 transitions. [2018-02-02 21:01:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-02 21:01:10,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:10,881 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:10,882 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash 997174415, now seen corresponding path program 35 times [2018-02-02 21:01:10,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:10,882 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:10,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:10,882 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:10,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:10,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:11,348 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-02 21:01:11,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:11,348 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:11,349 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:01:11,398 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-02 21:01:11,399 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:11,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:11,967 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-02 21:01:11,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:11,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-02-02 21:01:11,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-02 21:01:11,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-02 21:01:11,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 21:01:11,969 INFO L87 Difference]: Start difference. First operand 522 states and 699 transitions. Second operand 75 states. [2018-02-02 21:01:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:18,735 INFO L93 Difference]: Finished difference Result 576 states and 760 transitions. [2018-02-02 21:01:18,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 21:01:18,736 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 183 [2018-02-02 21:01:18,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:18,737 INFO L225 Difference]: With dead ends: 576 [2018-02-02 21:01:18,737 INFO L226 Difference]: Without dead ends: 576 [2018-02-02 21:01:18,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 21:01:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-02-02 21:01:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 536. [2018-02-02 21:01:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-02-02 21:01:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 718 transitions. [2018-02-02 21:01:18,743 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 718 transitions. Word has length 183 [2018-02-02 21:01:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:18,744 INFO L432 AbstractCegarLoop]: Abstraction has 536 states and 718 transitions. [2018-02-02 21:01:18,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-02 21:01:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2018-02-02 21:01:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-02 21:01:18,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:18,745 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:18,745 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:18,746 INFO L82 PathProgramCache]: Analyzing trace with hash 182232445, now seen corresponding path program 36 times [2018-02-02 21:01:18,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:18,746 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:18,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:18,746 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:18,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:18,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:19,146 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-02 21:01:19,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:19,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:19,147 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:01:19,192 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-02 21:01:19,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:19,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:19,607 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-02 21:01:19,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:19,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38] total 76 [2018-02-02 21:01:19,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-02 21:01:19,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-02 21:01:19,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1406, Invalid=4446, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 21:01:19,609 INFO L87 Difference]: Start difference. First operand 536 states and 718 transitions. Second operand 77 states. [2018-02-02 21:01:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:24,046 INFO L93 Difference]: Finished difference Result 591 states and 780 transitions. [2018-02-02 21:01:24,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 21:01:24,046 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 188 [2018-02-02 21:01:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:24,047 INFO L225 Difference]: With dead ends: 591 [2018-02-02 21:01:24,047 INFO L226 Difference]: Without dead ends: 591 [2018-02-02 21:01:24,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1406, Invalid=4446, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 21:01:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-02-02 21:01:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 550. [2018-02-02 21:01:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-02 21:01:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 737 transitions. [2018-02-02 21:01:24,051 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 737 transitions. Word has length 188 [2018-02-02 21:01:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:24,051 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 737 transitions. [2018-02-02 21:01:24,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-02 21:01:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 737 transitions. [2018-02-02 21:01:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-02 21:01:24,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:24,052 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:24,052 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash -957607601, now seen corresponding path program 37 times [2018-02-02 21:01:24,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:24,053 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:24,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:24,053 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:24,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:24,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:24,546 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-02 21:01:24,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:24,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:24,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:24,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:24,602 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-02 21:01:24,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:24,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-02-02 21:01:24,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:01:24,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:01:24,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:01:24,604 INFO L87 Difference]: Start difference. First operand 550 states and 737 transitions. Second operand 41 states. [2018-02-02 21:01:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:25,780 INFO L93 Difference]: Finished difference Result 606 states and 800 transitions. [2018-02-02 21:01:25,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 21:01:25,780 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 193 [2018-02-02 21:01:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:25,781 INFO L225 Difference]: With dead ends: 606 [2018-02-02 21:01:25,782 INFO L226 Difference]: Without dead ends: 606 [2018-02-02 21:01:25,782 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-02 21:01:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-02-02 21:01:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 564. [2018-02-02 21:01:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-02-02 21:01:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 756 transitions. [2018-02-02 21:01:25,786 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 756 transitions. Word has length 193 [2018-02-02 21:01:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:25,787 INFO L432 AbstractCegarLoop]: Abstraction has 564 states and 756 transitions. [2018-02-02 21:01:25,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:01:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 756 transitions. [2018-02-02 21:01:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-02 21:01:25,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:25,788 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:25,788 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash 958478525, now seen corresponding path program 38 times [2018-02-02 21:01:25,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:25,788 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:25,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:25,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:25,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:25,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:26,228 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-02 21:01:26,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:26,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:26,229 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:01:26,251 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:01:26,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:26,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:26,697 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-02 21:01:26,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:26,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 80 [2018-02-02 21:01:26,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-02 21:01:26,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-02 21:01:26,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1640, Invalid=4840, Unknown=0, NotChecked=0, Total=6480 [2018-02-02 21:01:26,698 INFO L87 Difference]: Start difference. First operand 564 states and 756 transitions. Second operand 81 states. Received shutdown request... [2018-02-02 21:01:26,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:01:26,730 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 21:01:26,734 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 21:01:26,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:01:26 BoogieIcfgContainer [2018-02-02 21:01:26,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 21:01:26,735 INFO L168 Benchmark]: Toolchain (without parser) took 74982.45 ms. Allocated memory was 400.6 MB in the beginning and 1.0 GB in the end (delta: 637.5 MB). Free memory was 358.7 MB in the beginning and 860.4 MB in the end (delta: -501.7 MB). Peak memory consumption was 135.8 MB. Max. memory is 5.3 GB. [2018-02-02 21:01:26,736 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 400.6 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:01:26,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.43 ms. Allocated memory is still 400.6 MB. Free memory was 358.7 MB in the beginning and 350.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-02 21:01:26,736 INFO L168 Benchmark]: Boogie Preprocessor took 20.92 ms. Allocated memory is still 400.6 MB. Free memory was 350.7 MB in the beginning and 349.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-02 21:01:26,736 INFO L168 Benchmark]: RCFGBuilder took 148.36 ms. Allocated memory is still 400.6 MB. Free memory was 349.3 MB in the beginning and 333.9 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. [2018-02-02 21:01:26,736 INFO L168 Benchmark]: TraceAbstraction took 74664.13 ms. Allocated memory was 400.6 MB in the beginning and 1.0 GB in the end (delta: 637.5 MB). Free memory was 333.9 MB in the beginning and 860.4 MB in the end (delta: -526.5 MB). Peak memory consumption was 111.1 MB. Max. memory is 5.3 GB. [2018-02-02 21:01:26,737 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.20 ms. Allocated memory is still 400.6 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.43 ms. Allocated memory is still 400.6 MB. Free memory was 358.7 MB in the beginning and 350.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.92 ms. Allocated memory is still 400.6 MB. Free memory was 350.7 MB in the beginning and 349.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 148.36 ms. Allocated memory is still 400.6 MB. Free memory was 349.3 MB in the beginning and 333.9 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 74664.13 ms. Allocated memory was 400.6 MB in the beginning and 1.0 GB in the end (delta: 637.5 MB). Free memory was 333.9 MB in the beginning and 860.4 MB in the end (delta: -526.5 MB). Peak memory consumption was 111.1 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 (564states) and interpolant automaton (currently 3 states, 81 states before enhancement), while ReachableStatesComputation was computing reachable states (7 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 (564states) and interpolant automaton (currently 3 states, 81 states before enhancement), while ReachableStatesComputation was computing reachable states (7 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 (564states) and interpolant automaton (currently 3 states, 81 states before enhancement), while ReachableStatesComputation was computing reachable states (7 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 (564states) and interpolant automaton (currently 3 states, 81 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 4 error locations. TIMEOUT Result, 74.6s OverallTime, 39 OverallIterations, 39 TraceHistogramMax, 58.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4679 SDtfs, 25967 SDslu, 68763 SDs, 0 SdLazy, 207411 SolverSat, 9020 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5123 GetRequests, 3557 SyntacticMatches, 4 SemanticMatches, 1562 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25601 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 893 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 8026 NumberOfCodeBlocks, 8026 NumberOfCodeBlocksAsserted, 444 NumberOfCheckSat, 7949 ConstructedInterpolants, 0 QuantifiedInterpolants, 3886901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5909 ConjunctsInSsa, 1297 ConjunctsInUnsatCore, 77 InterpolantComputations, 1 PerfectInterpolantSequences, 0/95836 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-02_21-01-26-741.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-02_21-01-26-741.csv Completed graceful shutdown